Cdma communications system using multiple spreading sequences

ABSTRACT

A CDMA communications system using multiple spreading sequences is characterized in that, by providing means of that a sequence-set consisting of M kinds of basic spreading sequences, each sequence having code length L, is prepared, an information-set consisting of γ components, not including the value 0 is made of a modulated sequence-set which are made by multiplying the said respective basic spreading sequences by an original information-set consisting of M components including (M−γ) pieces of the value 0, resulting in production of a selected sequence-set consisting of γ selected spreading sequences, means of that a modulated synthesized sequence s D  is produced by adding up all of the said selected spreading sequences, that a repeated core spreading sequence group s DN  is produced of the said respective selected sequences, that an enveloped sequence e D  is produced as an baseband transmit-data-frame by arranging the rear and the front parts of the said repeated core spreading sequence as the guard sequences, and that said data-frame modulates a carrier-wave having orthogonal frequency and then the resultant output is transmitted, and means of that a similar enveloped sequence e p  is produced with a pilot-information p as a baseband transmit-pilot-frame, and that the said pilot-frame is transmitted so as not to interfere with similar data-frames and pilot-frames for other users.

FIELD OF THE INVENTION

[0001] The present invention relates to a code division multiple access communications system (CDMA) using spread spectrum modulation which is able to separate and remove intra-cell and inter-cell-interference-noise having an especially detrimental effect among noise admixed in the transmission process, to enhance the frequency-utilization-efficiency, and to decrease the power-bandwidth-product. Here, a mobile communications system where the spread spectrum modulation is applied to BPSK signals is taken as an example, to describe such technology as to avoid intra-cell and inter-cell interference and to describe multi-ary modulation technology, etc.

BACKGROUND OF THE INVENTION

[0002] A Spread spectrum communications system is of using spread spectrum modulation technology where spreading sequences are modulated by transmission data. Due to this spread spectrum modulation, a data spectrum with a relatively narrow band width is spread to a wide frequency band and then the spectrum spread signals are transmitted. And in a region (cell or sector) where a base station (BS) provides communications services, there are plural user stations. Such a communications system is excellent in that a low transmission power per unit frequency is consumed, disturbance to other communications can be kept at a relatively low level, and the system has inherently strong capability resistant to ambient noise (external noise like CW noise) admixed in the transmissions process, and to inter-station-interference-noise incoming from interfering mobile stations other than a desired station. Generally this interference-noise includes delayed waves incoming via multipaths from the interfering-stations. However, because communications being performed by numerous stations share the same band, there is a problem such that increasing the number of users to be accommodated becomes difficult, due to the disturbance made by the inter-station-interference-noise. That is to say, it means that so many users can not be accommodated that a frequency-bandwidth to be occupied increases due to spread spectrum modulation, and it results in a decrease in frequency-utilization-efficiency or an increase in power-bandwidth required for 1 bit transmission.

[0003]FIG. 14 is a block diagram illustrating the general construction of a mobile communications system which performs direct-sequence spread spectrum communications (DS-SS) via a radio communications channel. Here, a transmitter EX modulates a spreading sequence generated by a sequence generator 1, by multiplying the sequence by a binary transmission data b, thus producing a baseband transmission output s(t). Transmitter TX further modulates this baseband transmission output s(t) with a carrier-wave having a frequency f₀ which has been generated by an oscillator 2, thus the spectrum of the signal conveying the data b may spread. Transmitter TX then transmits the resultant output to a radio communications channel. Furthermore, pseudo-noise (PN) sequences each of which is different from one for another user are used as such signatures that the spreading sequences may have a role of discriminating respective users' addresses. As PN sequences, maximum-length code (M) sequences or Gold sequences are generally used.

[0004] A receiver RX sends a spread-spectrum-modulated signal to an amplifier 3 via an antenna (not shown in the figures), amplifies the signal up to a required power level, and then frequency-mixes the amplified signal with a local signal f_(L)=(=f₀) which a local oscillator 4 has provided. Receiver RX then produces a low frequency component of the resultantly mixed output-signal as a baseband received demodulated signal r(t), by passing it through a low pass filter 5. In this case, coherent demodulation is generally performed.

[0005] Baseband demodulated signal r(t) is inputted to a multiplier 7 with the same spreading sequence generated by a sequence generator 6 as the sequence used by above-described transmitter TX. The resultant multiplied output is then integrated by an integrator 8 over the period of the spreading sequence length (1 symbol-frame), to obtain a matched filter output. A received binary data {circumflex over (b)} is detected by making this output on the hard decision. This function compares it with a threshold level by a detector 9 at the end of the above-described frame period (correlative demodulation). A control signal made based upon this detected data is inputted into the control terminal of sequence generator 6 via a synchronization detector 10, and the generating timing of the spreading sequence is controlled so that the sequence phase may be synchronized with that of the received signal. Furthermore, in receiver RX shown in FIG. 14, the arrangement of the multiplying functions provided by local oscillator 4 and sequence generator 6 is often exchanged each other; however, the overall demodulation function remains the same.

[0006]FIG. 15 schematically shows spectra of a received signal on a demodulation process. In FIG. 15(a), reference numerals 11 and 12 denote a spectrum of a spread spectrum modulated signal which is an input signal to a receiver, and a spectrum of admixed environmental noise, respectively. When the receiver demodulates (dispreads) this signal with the spreading sequence, spread spectrum modulated signal 11 which has been spread over a wide frequency-bandwidth as shown in FIG. 15(b), is converted into a narrow-band-signal 13, and environmental noise 12 is converted into a signal 14 whose spectrum is distributes over a wide frequency-band. Accordingly, this communications system can suppress the disturbance due to environmental noise.

[0007]FIG. 16 is a diagram showing the waveform of a baseband transmitting symbol-frame (hereafter the description of symbol is omitted) in a conventional direct-sequence spread spectrum communications system (DS-SS). In the figure, n, T, T_(c), b_(n), g(i), s(i) and s(t) denote the frame number which shows a time sequence order of symbol-frames, a transmitting symbol-frame period for a data, the chip-period, the n-th binary transmit-information, the spreading (impulse) sequence, the transmit-frame in discrete representation, and the transmit-frame in continuous time representation, respectively. Here is shown a sequence with length L=7 (chips) as an example of g(i). The n-th binary data b_(n) takes 1 and −1 corresponding to the data 1 and 0, respectively. Transmit-frame s(t) is a transmission-baseband-waveform obtained by replacing the respective impulses in s(i)=b_(n)g(i) with square waves. Thus, discrete sequence g(i) and its continuous time-waveform g(t) are given by: $\begin{matrix} {{g(i)} = {{\sum\limits_{i = 0}^{L - 1}\quad {c_{i}{\delta \left( {t - {i\quad T_{c}}} \right)}}} = {{\left( {c_{0},c_{1},c_{2},\quad {\ldots \quad c_{L - 1}}} \right)\quad c_{i}} \in {\pm 1}}}} & (1) \\ {{g(t)} = {{\sum\limits_{i = 0}^{L - 1}\quad {c_{i}{q_{1}\left( {t - {i\quad T_{c}}} \right)}\quad 0}} \leq t \leq T}} & (2) \\ \left. \begin{matrix} {{q(t)} = 1} & {{t} \leq \frac{T_{c}}{2}} \\ {\quad {= 0}} & {{t} \leq \frac{T_{c}}{2}} \end{matrix} \right\} & (3) \end{matrix}$

[0008] where c_(i)(i=0,1,2, . . . L−1), δ, and q(t) are the i-th chip amplitude of a spreading sequence, the delta function, a square-wave-function, respectively. An actual radio-band transmit-wave s_(a)(t) is generally produced by modulating a carrier-wave by baseband transmitting waveform s(t)[g(t) or −g(t)] having a bandwidth which is limited less than T_(e)=T_(e) ⁻¹.

[0009] Furthermore, when a square waveform is used as q(t), inter-symbol-interference takes place. To avoid this phenomenon, for Eq. (3) such a waveform is used that the auto-correlation function may take zero at the adjacent sampling points (called an f-type-sampling-function whose DFT conversion has cosine roll-off characteristics). In this case, if a receiver prepares the same waveform q(t) as that of the transmitting side, and performs correlative demodulation by multiplying a received symbol-frame by q(t) and a local carrier-wave. As a consequence, the desired wave components of the received signal will be obtained as an impulse sequence indicated in Eq. (1), where it is not subjected to the interference due to preceding or succeeding chips. That this impulse sequence is dispread with spreading sequence g(i) and then integrated. The n-th transmitted information b can be detected, by making the integrated output on the hard decision. If an f-type-sampling-function with a roll-off factor of α (generally taking a value between 0.1 and 1) is used, the radio bandwidth B_(S) of the above-described spreading signal and the radio bandwidth B_(D) of the transmit-data is given by:

B _(S)=(1+α)/T _(C) B _(D)=(1+α)/(LT _(C))=B_(S) /L.  (4)

[0010] However, L>>1 is required in a practical system, and in spite of using a bandwidth L times larger,

[0011] for the maximum number K of simultaneous calls (the number of above-described user-station), K<<L is required. Therefore the simultaneous transmission capacity/Hz is (K/L) times as large as that of a time-division-multiple-access radio system (TDMA). Consequently, there is such disadvantage that existing CDMA systems have frequency utilization-efficiency not higher than that of time-division-multiple-access system.

[0012] Thus, the reason why the number K of user stations compared to the sequence length cannot be set to a large value is that the cross-correlation-coefficient between sequence g₀(t) assigned to a desired station and a different sequence g_(k)(t)(k≠0) assigned to the other mobile station cannot be sufficiently small. Furthermore, considering delayed waves due to multipath, the cross-correlation-coefficient between many delayed sequence groups coming from respective user stations and sequence g₀(i) increases. That is, that the code-error-rate considerably deteriorates, because many interference waves with high cross-correlation come in, and therefore it is impossible to increase the number of user stations K and to raise the frequency-utilization-efficiency.

[0013] To reduce the disturbance due to the above-described interference-noise, many methods have been studied so far, the sufficient noise suppression effect has not been obtained. Here let's explain 4 kinds of preceding techniques having close relationship with this invention.

[0014] (A) Selective transmission system with parallel combinatorial sequences [Reference: S. Sasaki, H. Kikuchi, J. Zhu, and G. Marubayashi, “Error Rate Analysis of Coherent and Differential Multiphase Parallel Combinatorial Spread Spectrum System,” IEICE Trans. Fundamentals, Vol.E80-A, No.7, pp.1196-1203, 1997-07.]

[0015] (B) Isolated pilot assisted analytical demodulation system [Reference: Mitsuhiro Tomita, Noriyoshi Kuroyanagi, Naoki Suehiro, Shinya Matsufuji, “A Pilot Frame Assisted CDMA System using Gold Sequences”, Proceedings of WPMC'99, 9.4, pp.346-353, Amsterdam, 1999-09]

[0016] (C) Rake reception system [Publication: Ramjee Prasad “CDMA for wireless personal communications”, Artech House 1996, Sections 11.5 and 11.6 (p348, pp365-366)]

[0017] (D) Space-time coding system [Reference: Ben Lu and Xiaodong Wang, “Iterative Receivers for Multiuser Space-Time Coding Systems”, IEEE JSAC, VOL.18. No.11, November 2000]

[0018] In system (A), a transmitter prepares a sequence-set consisting of M kinds of basic spreading sequences, selects γ sequences in it, multiplies them by a set of binary information, and adds up all the resultant sequences to transmit. In this case, because a binary information-set of I bits to be transmitted corresponds to combinations which are determined by M and γ, the information quantity per symbol-frame is given by:

I=γ+log₂(_(M) C _(γ))  (5)

[0019] Consequently, this system is an example of Multi-ary systems and the improvement in frequency-utilization-efficiency has been expected.

[0020] When a transmit-symbol-frame arrives at a receiver, generally it turns out to be (J+1) waves consisting of the main wave and J delayed waves that are caused by multipaths. If the number of users is assumed to be K, the receiver receives (γ−1) waves (sequences) from the desired station as a self-interference-component, and γ(K−1)(J+1) waves from the other interfering stations as an inter-station-interference-component. Therefore the disturbance due to these interferences is considerably large in general. And this system requires many (MK kinds) spreading sequences, and the average value of cross-correlation-functions between an arbitrary pair of sequences in the sequences increases, as the family size MK increases. That is to say that the interference power increases in proportion to M, K, and J. Consequently, it is impossible to increase M and K to a large extent, in order to obtain desirable error-rate-characteristics by using system (A), as a result, it is impossible to raise the frequency-utilization-efficiency.

[0021] In system (B), a transmitter of each user transmits isolated pilot-frames so as not to suffer the disturbance of interference waves due to the other users. A receiver receives these isolated pilot-frames and always prepares highly accurate pilot-response from all the users. Each user transmitter produces a transmit-data-frame using both a sequence which is allocated to the user and a carrier wave which is common for all the users, and the produced frame is transmitted.

[0022] That is to say that system (B) is such a system that a base-station BS accurately acquires the transmission-path-characteristics (channel) from each user to BS by means of that each user transmits isolated pilot-signals to BS. Consequently, BS can obtain the pilot-response (channel-response) {p_(sk)}(s: the number showing the component order of the correlation-function for s=0,1,2, . . . L−1), corresponding to the transmission-path from the k(=0,1,2, . . . K−1)-th user. If a transmit-information of the k-th user is b_(k), the correlation response {Φ_(s)} of a received-frame r(t) is given by

{Φ_(s) }=b _(k) {p _(sk) }+Δb _(k) {p _(sk)}.  (6)

[0023] The second term on the right-hand in the above equation is an error component corresponding to a white noise included in r(t). By solving Eq. (6), a detected output {circumflex over (b)}_(k)=b_(k)+Δb_(k) of the transmitted information can be obtained. This system can remove the effect of interference waves almost completely. Because {p_(sk)} includes an interference component due to the white noise, perfect separation of interference waves can not be achieved, however, for CDMA systems to which interference waves give stronger disturbance than that white noise does, the advantage which almost all the interference wave components can be removed is valuable.

[0024] However, since system (B) uses the correlation responses {p_(sk)} makes a matrix with a size of L×L, as a result, for the parameter k(=0,1,2, . . . K−1), a relation given by K≦L is required. That is to say that the number of users who can be accommodated is limited by the spreading sequence length, and it raises a problem that the frequency-utilization-efficiency can not be sufficiently increased.

[0025] System (C) is a demodulating detection method used for a multipath environment where many of delayed waves generated by a desired user's transmitted frame are contained in a received frame. This system has a function such that not only a main wave but also the delayed waves are demodulated by multiple fingers (demodulation circuits operating synchronously with delayed waves) and their outputs are summed up. It is reported that the error increases considerably due to the inter-station-interference-disturbance as the number of users increases, because the above stated finger output includes inter-station-interference-components consisting of main waves and the delayed waves both coming from interfering stations.

[0026] System (D) is a CDMA communication system using multiple transmit- and receive-antennae. In this system, respective user transmitters produce plural frame-sequences by applying convolutional coding to a transmit-data-frame-sequence, and then transmit these coded frame-sequences via plural antennae. A base-station receiver obtains demodulated outputs for respective users with a multi-user demodulator, using a signal group received via plural (N_(d)) antennae, and then produces the first detected value b_(n) on the n-th frame. The time sequence of the first detected value b_(n) has a high error-rate. Based on these plural (N_(d)) sets of similar time sequences, a convolutional decoder performs decoding to produce the second detected values. By feeding back the detected values to the above-stated multi-user-demodulator and the convolutional decoder, the above-stated demodulation and decoding are performed to obtain the third detected values. This is such a system that the final detected values are decided by repeating the above stated processing multiple times.

[0027] System (D) requires a considerably complicated processing and a long delay time. It is the problem of this system that nevertheless it fails to increase the frequency-utilization-efficiency. In contrast, an actual sequence increasing technique of the present invention to be stated later is a system capable of obtaining the above stated first detected value b_(n) with a low error-rate, to acquire an excellent performance by using a simple processing, and it is a quite different technique from system (D).

[0028] The present invention has been done to overcome the performance limit in terms of the frequency-utilization-efficiency or power-bandwidth-product, as CDMA system evaluation measure, which the preceding systems have indicated, by providing multiary system design techniques with spreading sequence sets.

DISCLOSURE OF THE INVENTION

[0029] In order to solve the above-described probrems, the invention claimied in claim 1 of the present invention is characterized by the fact that, in a direct-sequence spread-spectrum CDMA communications system, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises such a function as to transmit information of I bits per symbol-frame by providing; means of that a sequence-set consisting of M kinds of basic spreading sequences g₀, g₁, . . . g_(m), . . . g_(M−1), each sequence having code length L, is prepared, an information-set consisting of components, {β^(S)}=(β₀, β₁, . . . β_(γ−1)) not including the value 0 is made of a modulated sequence-set which are made by multiplying the said M respective basic spreading sequences by an original information-set consisting of M components {β}=(β₉, β₁, . . . β_(M−1)) including (M−γ) pieces of the value 0, resulting in production of a selected sequence-set consisting of γ selected spreading sequences, means of that a modulated synthesized sequence s_(D) is produced by adding up all of the said selected spreading sequences, that a repeated core spreading sequence s_(DN) with a sequence length of NL is produced by repeating the said respective selected sequences an integer (N) times, that an enveloped sequence e_(D) is produced as an baseband transmitting data-frame by arranging the rear and the front parts of the said repeated core spreading sequence as the guard sequences at the front and the rear outsides of the said repeated core spreading sequence, and that said data-frame modulates a carrier-wave having the k-th orthogonal frequency f_(k) which is orthogonal each other on k and the resultant output is transmitted, and means of that a similar enveloped sequence e_(p) is produced based on a sequence pg_(p) which is made by multiplying a basic spreading sequence g_(p) for pilot by a pilot-information p as a baseband transmit-pilot-frame, and that the said pilot-frame is transmitted so as not to interfere with similar data-frames and pilot-frames of other users, and a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that a received signal is demodulated into a baseband signal using a local carrier-wave {circumflex over (f)}₀ of the 0-th orthogonal frequency f₀ which the transmitter of a desired user u₀ has used, that a synchronously received frame period with a length of NL chips is set at the position which is synchronized with the principal wave of signal components coming from the desired user included in this demodulated output, that the baseband signal component on this period is extracted as a repeated synchronously received data-frame r_(DN)*, and a repeated synchronously received pilot-frame r_(pN)* is also obtained in the same way, and that by applying an averaging operation to the said respective repeated frames, a synchronously received data-frame r_(D)* and a synchronously received pilot-frame r_(p)* both with reduced length L chips are produced, means of that the said synchronously received data-frame r_(D)* is analyzed using a channel response {μ} which is the demodulated output of the said synchronously received pilot-frame, resulting in production of an estimate-set {β′}=(β₀′, β₁′, . . . β_(M−1)′) corresponding to the said original information-set which has been transmitted by the desired station, and means of that a detected output-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(⊕−1) ^(S)} consisting of the information which the desired station has transmitted is obtained by judging the said estimate-set.

[0030] The invention claimed in claim 2 of a CDMA communications system using multiple spreading sequences is characterized in that, in a direct-sequence spread-spectrum CDMA communications system, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises such a function as to transmit information of I bits per symbol-frame by providing; means of that a sequence-set consisting of M kinds of basic spreading sequences g₀, g₁, . . . g_(m), . . . g_(M−1), each sequence having code length L, is prepared, an information-set consisting of γ components, {β^(S)}=(β₀, β₁, . . . β_(γ−1)) not including the value 0 is made of a modulated sequence-set which are made by multiplying the said M respective basic spreading sequences by an original information-set consisting of M components {β}=(β₀, β₁, β_(M−1)) including (M−γ) pieces of the value 0, resulting in production of a selected sequence-set consisting of γ selected spreading sequences, means of that a modulated synthesized sequence s_(D) is produced by adding up all of the said selected spreading sequences, that a repeated core spreading sequence s_(DN) with a sequence length of NL is produced by repeating the said respective selected sequences an integer (N) times, that an enveloped sequence e_(D) is produced as an baseband transmitting data-frame by arranging the rear and the front parts of the said repeated core spreading sequence as the guard sequences at the front and the rear outsides of the said repeated core spreading sequence, and that said data-frame modulates a carrier-wave having the k-th orthogonal frequency f_(k) which is orthogonal each other on k and the resultant output is transmitted, and means of that a similar enveloped sequence e_(p) is produced based on a sequence pg_(p) which is made by multiplying a basic spreading sequence g_(p) for pilot by a pilot-information p as a baseband transmit-pilot-frame, and that the said pilot-frame is transmitted so as not to interfere with similar data-frames and pilot-frames of other users, and a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that a received signal is demodulated into a baseband signal using a local carrier-wave {circumflex over (f)}₀ of the 0-th orthogonal frequency f₀ which the transmitter of a desired user u₀ has used, that a synchronously received frame period with a length of NL chips is set at the position which is synchronized with the principal wave of signal components coming from the desired user included in this demodulated output, that the baseband signal component on this period is extracted as a repeated synchronously received data-frame r_(DN)* and a repeated synchronously received pilot-frame r_(PN)* is also obtained in the same way, and that by applying an averaging operation to the said respective repeated frames, a synchronously received data-frame r_(D)* and a synchronously received pilot-frame r_(P)* both with reduced length L chips are produced, means of that M kinds of fabricated pilot-frames r_(pm)*(m=0,1,2, . . . M′−1) each having a length of L chips are produced by using both the channel response (μ) which is the demodulated output of the said synchronously received pilot-frame and the above-described sequence-set consisting of M kinds of basic spreading sequences, resulting in production of a pilot matrix ρ with a size of L×M, and means of that a system of M linear equations in M unknowns is made of the said pilot-matrix ρ, a received data-matrix d′=(d₀′, d₁′, . . . d_(L−1)′)^(T) consisting of the chip-elements of the above-described synchronously received data-frame r_(D)*, and an unknown matrix β′=(β₀′ β₁′ . . . β_(M−1)′)^(T), that an estimate-set {β′}=(β₀′, β₁′ . . . β_(M−1)′) corresponding to the original information-set is produced by solving the said system, and that a detected output-set {{circumflex over (β)}^(S)}=({circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)) consisting of the information-set which the desired user has transmitted is obtained by judging the said estimate-set.

[0031] The invention claimed in claim 3 of a CDMA communications system using multiple spreading sequences is characterized in that, in a direct-sequence spread-spectrum CDMA communications system, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises such a function as to transmit information of I bits per symbol-frame by providing; means of that a sequence-set consisting of M′ kinds of basic spreading sequences (g₀ ^(k), g₁ ^(k) . . . g_(m) ^(k) . . . g_(M′−1)), each having a sequence length of L chips, is prepared, an information-set consisting of γ components, {β^(kS)}=(β₀ ^(kS), β₁ ^(kS), . . . β_(γ−1) ^(kS)) not including the value 0, is made of a modulated sequence-set which is made by multiplying the said M′ respective basic spreading sequences by an original information-set consisting of M′ components {β^(k)}=(β₀ ^(k), β₁ ^(k), . . . β_(M′−1) ^(k)) including (M′−γ) pieces of the value 0, resulting in production of a selected sequence-set consisting of γ selected spreading sequences {β^(kS)g^(kS)}=(β₀ ^(kS)g₀ ^(kS), β₁ ^(kS), g₁ ^(kS) . . . β_(γ−1) ^(kS)g_(γ−1) ^(kS)), means of that a modulated synthesized sequence s_(D) ^(k) is produced by adding up all of the said selected spreading sequences, that a repeated core spreading sequence s_(DN) ^(k) with a sequence length of NL is produced by repeating the said synthesized sequences an integer (N) times, that an enveloped sequence e_(D) ^(k) is produced as an baseband transmitting data-frame by arranging the rear and the front parts of the said repeated core spreading sequence as the guard sequences at the front and the rear outsides of the respective sequences, and that the said data-frame e_(D) ^(k) modulates a carrier-wave having a frequency f_(D) which is a common carrier for data, and the resultant output is transmitted, means of that a similar enveloped sequence e_(p) ^(k) is produced using a sequence pg_(p) which is made by multiplying a basic spreading sequence g_(p) for pilot by a pilot-information p as a baseband transmit-pilot-frame, and the said pilot-frame modulates a carrier-wave having an orthogonal frequency f_(k)′, and the resultant output is transmitted, and means of that all of the frequencies f_(D) and f_(k)′ are set so as to be different each other by integer times of a frequency f_(G) corresponding to the reciprocal of the synchronously received frame-period with length NL chips, and a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that a received signal is demodulated into baseband signals using local carrier-waves {circumflex over (f)}_(k)′ and {circumflex over (f)}_(D) respectively having orthogonal frequencies f_(k)′ and f_(D) which the transmitter has used, that a synchronously received frame-period with a length of NL chips is set so as to satisfy a quasi-synchronous condition, that a repeated synchronously received data-frame r_(DN)* and a repeated synchronously received pilot-frame r_(pN)* are produced by extracting the baseband signal components on this period, and that a synchronously received data-frame r_(D)* and a synchronously received pilot-frame r_(p) ^(k*) both having a reduced length of L chips are produced by applying an averaging operation to the said respective repeated frames, means of that M′ kinds of fabricated pilot-frames r_(pm) ^(k*)(m=0,1,2, . . . M′−1) each having a length of L chips are produced by using both the channel response (μ) which is the demodulated output of the said synchronously received pilot-frame and the above-described sequence-set consisting of M′ kinds of basic spreading sequences, resulting in production of a pilot-matrix p′ with a size of L×M using M=KM′ pieces of the fabricated pilot-frames, and means of that a system of M linear equations in M unknowns is made of the said pilot-matrix ρ′, a received data-matrix d′=(d₀′, d₁′, . . . d_(L−1)′)^(T) consisting of the chip-elements of the above-described synchronously received data-frame r_(D)*, and an unknown matrix β^(k′)=(β₀ ^(0′)β₁ ^(0′) . . . β_(M′−1) ^(0′), β₀ ^(1′)β₁ ^(1′) . . . β_(M′−1) ^(1′), β₀ ^(K−1′)β₁ ^(K−1′) . . . β_(M′−1) ^(K−1′))^(T), that an estimate-set {β^(k′)}=(β₀ ^(k′)β₁ ^(k′) . . . β_(M′−1) ^(k′)) corresponding to the original information-set which the k-th user has transmitted is produced by solving the said system, and that a detected output-set {{circumflex over (β)}^(kS)}=({circumflex over (β)}₀ ^(kS), {circumflex over (β)}₁ ^(kS), . . . {circumflex over (β)}_(γ−1) ^(kS)) consisting of the above-described transmitted information for the k-th user is obtained by judging the said estimate-set.

[0032] The invention claimed in claim 4 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 2, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises; means of that a transmitting pilot-frame e_(p) which is an enveloped sequence produced based on a basic spreading sequence g_(p) for pilot described above is transmitted over a carrier-wave with an orthogonal frequency f_(k)′, that the said orthogonal frequencies f_(k)′ and f_(k)(k=0,1,2, . . . K−1) used for transmitting the above-described pilot-frames and data-frames respectively are set so as to be different on k each other by integer times of a frequency f_(G) which is the reciprocal of the repeated synchronously received frame period T_(G), resulting in providing of the frequency-division-pilot-frame-transmission-function by setting the sequence length of the above-described guard sequences so that any boundaries of the respective received flock-flames r_(pf) ^(k) and r_(Df) ^(k) coming from all the users may not be included in the synchronously received frame period, and a receiver comprises; means of that the said synchronously received pilot-frame is demodulated using a local frequency {circumflex over (f)}₀ corresponding to the orthogonal frequency f₀′ which the transmitter of desired station u₀ has used, and means of that an isolated-pilot-response for a desired station without being subjected to interference due to both the above-described data-frame received from a desired station and all the interference-waves received from interfering stations is produced.

[0033] The invention claimed in claim 5 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 2, a transmitter of the k-th user u_(k) comprises; means of that a synthesized frame-sequence is produced by providing empty slots in the above-described baseband transmit-data-frame sequence, and inserting pilot-frames in said data-frame sequence in time-division manner, and means of that the said synthesized frame-sequence is transmitted over the above-described k-th orthogonal carrier wave having frequency f_(k), and a receiver comprises; means of that the parts corresponding to the pilot-frames in a frame-sequence made of the above-described synchronously received frames are extracted in a time-division manner and then the extracted parts is demodulated, and an isolated-pilot-response without being subjected to interference due to the above-described interference-waves is produced.

[0034] The invention claimed in claim 6 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 3, a transmitter of the k-th user u_(k)(k=0,1 . . . K−1) comprises; means of that a transmit-pilot-frame for u_(k) which is produced by modulating a common carrier-wave for pilot having an orthogonal frequency f_(p) by the k-th baseband transmitting pilot-frame described above e_(p) ^(k) is transmitted over such a transmission timing as to receive in time-division-manner with a similarly received pilot-frame which the k′-th user u_(k)(k′≠k) has transmitted, and a receiver comprises; means of that a baseband pilot-frame for u_(k) is demodulated in time-division-manner from a pilot-frame-sequence demodulated by a carrier-wave having the said orthogonal frequency f_(p), and the above-described channel-response is produced using the resultant demodulated output.

[0035] The invention claimed in claim 7 of a CDMA communications system using multiple spreading sequences is characterized in that, in claim 2, a receiver detects the transmitted information of I bits per symbol-frame by comprising; means of that the 0-shift-correlations p_(nm)′ between the m-th fabricated pilot-frame r_(nm)* and M data analyzing sequences y_(n)(n=0,1,2, . . . M−1) each of which differs each other are produced, and that a pilot-response-matrix P′ with a size of M×M constituted of the said correlations is produced, means of that a data-response-matrix Φ′=(Φ₀′, Φ₁′, Φ₂′, . . . Φ_(M−1)′)^(T) is produced by such a method as to obtain the 0-shift correlation Φ_(n)′ between the above-described synchronously received data-frame r_(n)* and the n-th data analyzing sequence y_(n), and means of that a system of M linear equations in M unknowns are made of the pilot-response-matrix P′, the data-response-matrix Φ′ and an unknown matrix β′=(β₀′, β₁′, β₁′, . . . β_(M−1)′)^(T), that an estimated set β′=(β₀′, β₁′, β₁′, . . . β_(M−1)′) corresponding to the said original information-set is obtained by solving the said system, and that a detected output-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)} consisting of the above-described transmitted information is obtained by judging the said estimate-set.

[0036] The invention claimed in claim 8 of a CDMA communications system using multiple spreading sequences is characterized in that, in claim 3, a receiver detects the transmitted information of I bits per symbol-frame which is transmitted by each user by comprising; means of that M′ fabricated pilot-frames r_(pm) ^(k*) and M′ data analyzing sequences y_(n) ^(k)(n=0,1,2, . . . M′−1) corresponding to the k-th user u_(k)(k=0,1,2, . . . K−1) are produced, means of that a pilot-response-matrix P′ with a size of (M×M) constituted of the 0-shift-correlations p_(nm) ^(k*) between the said respective fabricated pilot-frames rpm and the said respective data analyzing sequences y_(n) ^(k) is produced, and means of that a data-response-matrix Φ′=(Φ₀ ^(0′), Φ₁ ^(0′), . . . Φ_(M′−1) ^(0′), Φ₀ ¹, Φ₁ ¹, . . . Φ_(M′−1) ¹, . . . Φ₀ ^(K−1), Φ₁ ^(K−1), . . . Φ_(M′−1) ^(K−1))^(T) is produced using such a method as to obtain the 0-shift-correlation Φ_(n) ^(k′) between the above-described synchronously received data-frame r_(D)* and the said data analyzing sequence y_(n) ^(k), that a system of M linear equations in M unknowns is made of the said pilot-response-matrix P′, the said data-response-matrix Φ′ and an unknown matrix β′=(β₀ ^(0′), β₁ ^(0′), . . . β_(M′−1) ^(0′), β₀ ^(1′), β₁ ^(1′), . . . β_(M′−1) ^(1′), β₀ ^(K−1), β₁ ^(K−1), . . . β_(M′−1) ^(K−1))^(T), that an estimate-set {β^(k′)}=(β₀ ^(k′), β₁ ^(k′), . . . β_(M′−1) ^(k′) corresponding to the transmitted information-set consisting of M′ components for each user is obtained by solving said system, and that a detected output-set {{circumflex over (β)}^(kS)}={{circumflex over (β)}₀ ^(kS), {circumflex over (β)}₁ ^(kS), . . . {circumflex over (β)}_(γ1) ^(kS)} corresponding to the transmitted information of each user is obtained by judging the estimate-set.

[0037] The invention claimed in claim 9 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 2 and 7, a transmitter of the k-th user u_(k) comprises; means of that a sequence-set consisting of M kinds of basic spreading sequences having L chips is prepared, being transmitted, and a receiver detects the transmitted information of I bits per symbol-frame which is transmitted by each user by comprising; means of that double length fabricated pilot-frames r_(pmE)* and a double length synchronously received data-frame r_(DE)* both having 2L chips are produced using the real part and the imaginary part of the respective chip-elements of both the fabricated pilot-frames r_(Pm)*(m=0,1,2, . . . M−1) and the synchronously received data-frame r_(D)*, that a system of M linear equations in M unknowns is made of a double length received pilot-matrix ρ′ with a size of 2L×M made of the double length fabricated pilot-frames r_(PmE)*, a received data-matrix d′ which consists of the chip-elements of the double length synchronously received data-frame r_(DE)*, and an unknown matrix β′, that an estimate-set {β′} corresponding to the original information-set is produced by solving the said system, and that a detected output-set {{circumflex over (β)}^(S)} consisting of the information which the desired station has transmitted is obtained by judging the said estimate-set.

[0038] The invention claimed in claim 10 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 3 and 8, a transmitter of the k-th user u_(k) comprises; means of that a sequence-set consisting of M kinds of basic spreading sequences having L chips is prepared, being transmitted, and a receiver detects the transmitted information of I bits per symbol-frame which is transmitted by each user by comprising; means of that double length fabricated pilot-frames r_(pmE) ^(k)* and a double length synchronously received data-frame r_(DE)* both having 2L chips are produced using the real part and the imaginary part of the respective chip-elements of the fabricated pilot-frames r_(pm) ^(k*)(m=0,1,2, . . . M−1, k=0,1,2, . . . K−1) and the synchronously received data-frame r_(D)*, that a system of M linear equations in M unknowns is made of a double length received pilot-matrix ρ′ with a size of 2L×M made of the double length fabricated pilot-frame r_(pmE) ^(k)*, a received data matrix d′ which consists of the chip-elements of the double length synchronously received data-frame, and an unknown matrix β^(k)′, that an estimate-set {β^(k)′} corresponding to the original information-set is produced by solving the said system, and that a detected output-set {{circumflex over (β)}^(kS)} consisting of the information which the desired station has transmitted is obtained by judging the said estimate-set.

[0039] The invention claimed in claim 11 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 3, 7 and 8, a transmitter comprises; means of that transmit-signals are transmitted via one or plural transmit-diversity-antennae A_(Tv)(v=0,1,2, . . . ), and a receiver comprises; means of that received signals r_(d) are received via plural receive-diversity-antennae A_(RD)(d=0,1,2, . . . ), that baseband demodulated outputs are produced at pilot and data demodulating parts D_(pd) and D_(Dd) for the d-th received signal rd by using a local carrier-wave corresponding to a carrier-wave which the transmitter of a desired station has used, and thereby the d-th synchronously received pilot- and data-frames r_(pd)* and r_(Dd)* are produced, that the d-th channel response {μ}_(d) is obtained with the d-th pilot-frame r_(pd)*, that a fabricated pilot-frame r_(pmd)* or r_(pmd)* corresponding to the d-th received signal is obtained using the said channel response {μ}_(d) and the m-th basic spreading sequence which the desired station has used, that extended fabricated pilot-frames r_(pmE)* or r_(pmE) ^(k*) are produced by using such a method as to increase the frame length by arranging chip-elements of the said fabricated pilot-frames which belong to the mutually different antenna numbers d on a time axis, that an extended synchronously received data-frame r_(DE)* is produced by arranging the said d-th synchronously received data-frame r_(Dd)* on a time axis in the same way, that an estimate-set {β′}=(β₀′, β₁′, . . . β_(M−1)′) corresponding to the original information-set is produced by analyzing the said extended synchronously received data-frame r_(DE)* with the said extended fabricated pilot-frames r_(PmE)* or r_(PmE) ^(k*), and that a detected output-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)}consisting of the information which the desired station has transmitted is obtained by judging the said estimate-set.

[0040] The invention claimed in claim 12 of a CDMA communications system using multiple spreading sequences is characterized in that, in claim 11, a transmitter comprises; means of that a sequence-set consisting of N_(v) basic spreading sequences {g_(m)′}=(g_(m0), g_(m1), . . . g_(mv), . . . g_(m,Nv−1)) per one transmit-information β_(m) is prepared, that the v-th basic spreading sequence g_(mv) is modulated by the same information β_(m) to produce a core-sequence for data and then an enveloped sequence for data based on this modulated output, that an enveloped sequence for pilot is produced in the same way, that both the said enveloped sequences are lead to the v-th transmit-diversity-antenna A_(Tv) to transmit, and a receiver comprises; means of that the components which the v-th transmit-diversity-antenna A_(Tv) has transmitted are demodulated based on an input received via the d-th received-diversity-antenna A_(Rd), resulting in production of both the d-th synchronously received data-frames r_(Dvd)* and the d-th synchronously received pilot-frames r_(pvd)*, that a channel response {μ}_(vd) from the v-th transmit-antenna to the d-th received-antenna is produced using the said synchronously received pilot-frame, that the d-th fabricated pilot-frames r_(pmvd)* or r_(pmvd) ^(k*) are produced using the channel response, that an extended fabricated pilot-frame r_(pmE)* or r_(pmE) ^(k*) is produced by such a method as to increase the frame length by arranging chip-elements of fabricated pilot-frames which belong to the respective pairs of transmit- and receive-antenna numbers v and d (mutually different)* on a time axis, that an extended received frame r_(DE)* is produced by arranging the said synchronously received frame r_(Dvd)* in the same way, and that the said extended synchronously received frame r_(DE)* is analyzed with the said extended fabricated pilot-frames r_(pmE)* or r_(pmE) ^(k*).

[0041] The invention claimed in claim 13 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 11 and 12, such a function is added that, when the elements of the above-described fabricated pilot-frames and synchronously received data-frames which belong to the mutually different transmit- and receive-antenna ordinal numbers are arranged on a time axis, and thereby extended fabricated pilot-frames and extended synchronously received data-frames are produced, a real amplitude component and an imaginary amplitude component of a chip-element are arranged so as to take individual time positions to constitute each frame.

[0042] The invention claimed in claim 14 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 2, 3, and 7 to 12, a receiver comprises such a function as to detect the transmitted information of I bits per symbol-frame which is transmitted by each user by providing; means of that instead of solving a system of M linear equations in M unknowns, an optional number M_(R) which is smaller than M, and equal to γ or larger than γ is chosen to produce a reduced size system of M_(R) linear equations in M_(R) unknowns, and N_(R) sets of the reduced size systems are produced, that N_(R) estimate-sets of the spreading sequence-set {β′}=(β₀′, β₁′, . . . β_(MR−1)′) or {β_(k′)}=(β₀ ^(k′), β₁ ^(k′), . . . β_(MR−1) ^(k′)) are obtained as solutions of the said respective equations, and that an evaluation function Δβ which shows deviations between the said respective estimate-sets and the original information-set {β} or {β^(k)} is obtained, and means of that an estimate-set {β′} or {β^(k)} corresponding to the original information-set based on a set with which Δβ takes the minimum is obtained, and that a detected information-set {{circumflex over (β)}^(S)} or {{circumflex over (β)}^(kS)} consisting of the above-described transmitted information is obtained by judging the said estimate-set.

[0043] The invention claimed in claim 15 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 2, 7, 9, and 11 to 13, a receiver comprises such a function as to detect the transmitted information of I bits per symbol-frame which is transmitted by each user by providing; means of that instead of solving a system of M linear equations in M unknowns, combination-sets U_(s)(s=0,1, . . . N_(γ)−1) which consists of γ frames taken out of the fabricated pilot-frames r_(pm)(m−0,1,2, . . . M−1) is made, that a sum of the frames which is made by multiplying the elements of plural virtual sequences C_(h)(c₀, c₁, . . . c_(γ−1)) by the respective frames of a said combination-set U_(s) is produced as a fabricated transmitted frame F_(sh), and that correlations between respective fabricated transmitted frames and the above-described synchronously received data-frame r_(D)* are obtained, and means of that the maximum likelihood fabricated transmitted frame is obtained based on the said correlations, and that a detected information-set {{circumflex over (β)}^(S)} consisting of the above-described transmitted information is obtained by judging the said estimate-set {β′} using the constituent elements U_(s) and C_(h) of the maximum likelihood fabricated transmitted frame.

[0044] The invention claimed in claim 16 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 3, 8, and 10 to 13, a receiver comprises such a function as to detect the transmitted information of I bits per symbol-frame which is transmitted by the k-th user u_(k) by providing; means of that instead of solving a system of M linear equations in M unknowns, combination-sets U_(S) ^(k)(s=0,1,2, . . . N_(γ)−1) which consists of Kγ frames taken out of the fabricated pilot-frames r_(Pm) ^(k*)(m=0,1,2, . . . M′−1) for the k-th user u_(k)(k=0,1,2, . . . K) is made, that a sum of the frames which is made by multiplying the elements of plural virtual sequences C_(h)(c₀, c₁, . . . c_(Kγ−1)) by the respective frames of a said set U_(s) ^(k) is produced as a fabricated transmitted frame F_(sh) ^(k), and that correlations between respective fabricated transmitted frames F_(sh) ^(k) and the above-described synchronously received data-frame r_(D)* is obtained, and means of that the maximum likelihood fabricated transmitted frame is obtained based on the said correlations, and that a detected information-set consisting of the above-described transmitted information is obtained by judging an estimate-set corresponding to the original information-set using the constituent elements U_(s) ^(k) and C_(h) of the maximum likelihood fabricated transmitted frame.

[0045] The invention claimed in claim 17 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 2 and 3, a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that the above-described fabricated pilot-frames r_(pm)* or r_(pm) ^(k*)(m=0,1,2, . . . M−1, k=0,1,2, . . . K−1) are generated, and such analyzing sequences w_(m) that the 0-shift-correlations with fabricated pilot-frames r_(pm)* and r_(pm′)*(m′≠m) may take 1 and 0, respectively, are produced, means of that plural estimate-sets set {β′}=(β₀′, β₁′, . . . β_(M−1)′) corresponding to the original information-set are produced based on the 0-shift correlations between the above-described synchronously received data-frame r_(D)* and analyzing sequences w_(m), that by judging the maximum likelihood set taken out of these estimate-sets a detected information-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)} consisting of the above-described transmitted information is obtained, or means of that plural analyzing sequences w_(m) ^(k) such that 0-shift-correlations with fabricated pilot-frames r_(pm) ^(k*) and r_(pm′) ^(K′*)(m′≠m, k′≠k; m′=m, k′≠k; m′≠m, k′=k) may take 1 and 0, respectively, are produced, means of that plural estimate-sets {β^(k′)}=(β₀ ^(k′), β₁ ^(k′), . . . β_(M−1) ^(k′)) corresponding to the original information-set are produced based on the 0-shift-correlations between the above-described synchronously received data-frame r_(D)* and the analyzing sequences w_(m) ^(k), and means of that by judging the maximum likelihood set taken out of these sets a detected information-set {{circumflex over (β)}^(kS)} consisting of the above-described transmitted information is obtained.

[0046] The invention claimed in claim 18 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 3, 7 and 8, a transmitter comprises; means of that a binary to multi-level conversion is carried out by using such a method as to correspond a transmit-information of I bits to a case-number obtained by synthesizing the first selection where an optional number y is selected out of the numbers of spreading sequences, ranging from one to γ_(m), and the second selection where γ spreading sequences are selected out of an above-described sequence-set consisting of M or M′ kinds of basic spreading sequences as the sequence kinds, means of that a selected sequence-set consisting of γ selected spreading sequences is produced from the above-described original information-set {β} or {β^(k)} to produce a transmitting frame, and a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that fabricated pilot-frames are obtained based on the above-described channel response {μ}, and an estimate-set {β′} or {β^(k′)} corresponding to the original information-set is obtained by analyzing the above-described synchronously received data-frame r_(D)* with them, means of that while a detected value {circumflex over (γ)} for the transmitted spreading sequence number is obtained using the said estimate-set, and means of that a detected information-set {{circumflex over (β)}^(s)} or {{circumflex over (β)}^(kS)} consisting of {circumflex over (γ)} selected information components is obtained per user.

[0047] The invention claimed in claim 19 of a CDMA communications system using multiple spreading sequences is characterized in that, in claim 7, a receiver comprises; means of that in solving an above-described system of M linear equations in M unknowns, it is assumed that frames produced by multiplying dummy-information-components {β^(D)}=(β_(M) ^(D), β_(M+1) ^(D), . . . β_(M+h−1) ^(D)) by h(≧1) dummy spreading sequences which are not included in the basic spreading sequence-set provided in a transmitter may be included in the above-described synchronously received data-frame, means of that M pieces of the said fabricated pilot-frames r_(pm)*(m=0,1,2, . . . M−1) and the (M+h) pieces of the said data analyzing sequences y_(n)(n=0,1,2, . . . M−h−1) are produced and an extended pilot-response-matrix P₊′ is produced by adding h additional row vectors A to M row vectors each having (M+h) elements which are produced from the 0-shift-correlations between the above-described fabricated pilot-frames r_(pm)* and the said data analyzing sequences y_(n), means of that a corrected data-response-matrix Φ₊″=(Φ₀″, Φ₁″, . . . Φ_(M+h−1)″)^(T) is produced using a method of adding correcting terms to the 0-shift-correlations between the above-described synchronously received data-frame r_(D)* and the data analyzing sequences y_(n), means of that a system of (M+h) linear equations in (M+h) unknowns which is made of the said enlarged pilot-response matrix P₊′, the corrected data-response-matrix Φ₊″ and an extended unknown matrix β₊′=(β′, β^(D))^(T)=(β₀′, β₁′, . . . β_(M−1)′, β_(M) ^(D), β_(M+1) ^(D), . . . β_(M+h−1) ^(D))^(T) is produced, and means of that after the said additional row vector A is selected so as to increase the determinant or normalized singular value of the said enlarged pilot-response-matrix P₊′ to enhance the regularity, an estimated set {β′} or {β^(k′)} corresponding to the original information-set is obtained by solving the said system of (M+h) linear equations in (M+h) unknowns.

[0048] The invention claimed in claim 20 of a CDMA communications system using multiple spreading sequences is characterized in that, in claim 2, a receiver comprises; means of that in solving an above-described system of M linear equations in M unknowns, an above-described enlarged pilot-matrix P₊′ is produced so as to enhance the regularity of the said matrix using the above-described fabricated pilot-frames r_(pm)*, h additional row vectors A, and h additional column vectors C which are random sequences, means of that an extended unknown matrix β₊′ is made by adding h additional dummy-information {β^(D)} to an unknown set {β′} consisting of M unknowns, means of that a corrected synchronously received data-frame r_(D+)* is made by adding correcting terms to the above-described synchronously received data-frame r_(D)*, means of that a solution set {β₊′} is obtained by solving a system of (M+h) linear equations in (M+h) unknowns which is composed of the said enlarged pilot-matrix ρ₊′, the extended unknown matrix β₊′, and the corrected received data-matrix d₊′ consisting of the chip-elements of the corrected synchronously received data-frame r_(D+)*, and plural solution sets {β₊*} are resultantly obtained corresponding to the said additional column vectors C by solving the said systems, and means of that the maximum likelihood solution taken out of the solution sets is set to an estimate-set {β′} corresponding to the original information-set.

[0049] The invention claimed in claim 21 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 3, an identical sequence-set consisting of M kinds of basic spreading sequence allocated to some cells, and a scrambling sequence inherent to each cell is allocated to a cell, and a transmitter of the cell comprises; means of that a scrambled sequence-set is produced by multiplying respective sequences of the spreading sequence-set by the scrambling sequence inherent to the cell to produce a transmit-frame, and a receiver comprises; means of that pilot and data analyzing sequences are produced based on the above-described scrambled sequence-set to analyze the above-described synchronously received frame.

[0050] The invention claimed in claim 22 of a CDMA communications system using multiple spreading sequences is characterized in that, in claim 1, a transmitter of the k-th user u_(k) comprises; means of that a sequence-set consisting of M=M′=N kinds of basic spreading sequences (g₀, g₁, g₂, . . . g_(M−1)) is produced by multiplying code words (h₀, h₁, . . . h_(N−1)) consisting of rows of an hadmarl matrix with a size of N×N by a random sequence-set consisting of M′ kinds of spreading sequences (g₀ ⁰, g₁ ⁰, . . . g_(M′−1) ⁰).

[0051] The invention claimed in claim 23 of a CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 and 2, a transmitter comprises; means of that a sequence-set consisting of M=M′L kinds of cyclically shifted sequences is prepared as a basic spreading sequence-set by producing the s=(0,1,2, . . . L−1)-shift-sequences of respective spreading sequences which constitutes a sequence-set consisting of M′ kinds of spreading sequences (g₀, g₁, . . . g_(M′)) with L chips in sequence length, means of that transmit-information of I bits is converted into an information-set consisting of y components {β^(S)} selected out of the basic spreading sequence-set, and means of that a transmit-frame is produced and transmitted by using a selected sequence-set {β^(S)g^(S)} corresponding to the said information-set, and a receiver detects the transmitted information of I bits per symbol-frame by producing a detected output-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)} consisting of the information which the desired station has transmitted by the method stated in claim 2.

BRIEF DESCRIPTION OF THE DRAWINGS

[0052]FIG. 1 shows explanatory drawings of intra-cell transmission-paths of CDMA communication system, in which (a) shows the paths of up-link transmission, while (b) shows the paths of down-link transmission.

[0053]FIG. 2 shows an explanatory drawing of the first embodiment-example of the invention, indicating a circuit composition of the k-th user transmitter TX (u_(k)) of a frequency-division data-pilot-frame-transmission-system.

[0054]FIG. 3 shows an explanatory drawing of an embodiment-example of the invention, indicating a model of transmission paths between transmitters and a receiver of the communication system.

[0055]FIG. 4 shows an explanatory drawing of the first embodiment-example of the invention, indicating a circuit composition of base-station-receiver RX (u_(o)) of a frequency-division data-pilot-frame-transmission-system.

[0056]FIG. 5 shows an auxiliary explanatory drawing of FIGS. 2 to 4, indicating a method to compose frequency-division symbol-frames transmitted by the users for the up-link.

[0057]FIG. 6 shows auxiliary explanatory drawings of FIGS. 2 to 4, indicating the spectrum diagram of core-sequence contained in transmission-frames.

[0058]FIG. 7 shows auxiliary explanatory drawings of FIGS. 2 to 4, indicating the time-sequence-diagram of continuous-time-waveforms of transmit- and receive-frames.

[0059]FIG. 8 shows auxiliary explanatory drawings of FIG. 7, indicating the detailed view of baseband transmit- and receive-symbol-frames of a single user (u_(o)).

[0060]FIG. 9 shows the block diagrams of a receiver RX (u_(o)) used by the second embodiment-example of the invention.

[0061]FIG. 10 shows an explanatory drawing of the third embodiment-example of the invention, indicating the circuit composition of a receiver using a data-channel-sharing-method.

[0062]FIG. 11 shows explanatory drawings of the fourth embodiment-example of the invention, in which (a) shows the circuit composition diagram of a transmitter TX (u_(k)) using diversity-antennae, while (b) shows the circuit composition diagram of a receiver RX (u₀).

[0063]FIG. 12 shows auxiliary explanatory drawings of FIGS. 2, 4, 9, 10, and 11, indicating the composition diagrams of baseband transmission-frames used for pilot-time-division transmission-systems.

[0064]FIG. 13 shows auxiliary explanatory drawings of FIGS. 4, 9, 10, and 11 each of which is used as a partial circuit of the receiver, and (a) is a correlator C_(or1) (q), (b) is a correlator C_(or2) (y), and (c) is a matched filter MF(z).

[0065]FIG. 14 shows a block diagram indicating general composition of a mobile communication system using direct-sequence spread spectrum communications (DS-SS) over radio-channels.

[0066]FIG. 15 shows the modeled spectrum of signals appeared in the transmission process.

[0067]FIG. 16 is a diagram showing correspondence between a spreading (impulse) sequence g₁ and binary information in conventional direct-sequence spread spectrum communication systems (DS-SS).

PREFERRED EMBODIMENT OF THE PRESENT INVENTION

[0068] This invention is related to a system, which can overcome the above-described problem inherent to CDMA communication systems, that is, a characteristic vulnerable to the disturbance caused by interference-waves incoming from the other users, and also can enhance the frequency-utilization-efficiency. Let us explain embodiment-examples applied to technically difficult up-link transmission systems. In the invention, the transmitter u_(k) of the k-th (=0, 1, . . . K−1) user transmits an isolated pilot-frame, and the base-station receiver BS has a function eliminating the disturbance component caused by interference-waves in data-frames, similarly to the above-described method (B) by utilizing this pilot-frame or its correlation-response as well as by utilizing the self-interference-waves. Moreover, the transmitter converts the binary data-information-set {b} to be transmitted to multi-value-information {β} in advance. In other words, by multiplying this multi-value-information {β} to a multiple sequence-set, a binary data-set may be related to a multi-value. Namely, TX selects γ(≦M) spreading sequences from M kinds of sequences by multiplying M kinds of codes (sequence population) by an information-set {β}=(β₀, β₁, . . . β_(M−1)) including M−γ pieces of the value 0. Then, γ components composing a binary information-set, not including the value 0, {β^(s)}={β₀ ^(s), β₁ ^(s), . . . β_(γ−1) ^(s)} labeled by both new ordinal numbers and a superscript S are multiplied by these selected spreading sequences for transmission. The receiver detects the kind and the polarity (±1) of the respective selected sequences. From this detected output, the above-described binary information-set {{circumflex over (b)}} is restored. This is a sort of multi-ary systems which can transmit the information of multiple bits I per symbol frame, and can enhance the frequency-utilization-efficiency.

[0069]FIG. 1 is an auxiliary explanatory drawing of the invention, indicating the intra-cell-transmission-paths of a CDMA communication system. The up-link transmission shown in FIG. 1(a) indicates the transmission state where the transmit-waves s_(U)(u_(k)) are sent from the k-th mobile station u_(k)(k=0,1,2, . . . K−1) (hereinafter referred to as “the k-th user station”) communicating within this cell to the base station BS. Assuming that the 0-th user u_(o) is a desired station (the subsequent description will be made under this assumption), the received direct wave r_(D)(t) to BS becomes the desired wave. In the figure, the dotted lines show delayed waves due to multi-paths. A delayed wave generated by the transmission wave which the desired station has sent out becomes a self-interference-wave r_(SI)(t). On the other hand, the transmission-waves sent out from the user stations other than the desired station (also referred to as the “interfering stations”) are received as the inter-station-interference-waves r_(XI)(t). These waves contain not only the direct waves, but also the delayed waves due to multi-paths as shown in the figure. Accordingly, the received interference-waves r_(I)(t) is equal to a sum of the self-interference-wave and the inter-station-interference-waves. The total received waves r(t) may be expressed as follow $\begin{matrix} \left. \begin{matrix} {{r(t)} = {{r_{D}(t)} + {r_{I}(t)} + {x(t)}}} \\ {{{r_{I}(t)} = {{r_{SI}(t)} + {r_{XI}(t)}}}\quad} \end{matrix} \right\} & (7) \end{matrix}$

[0070] where x(t) is the Additive White Gaussian Noise (AGWN).

[0071]FIG. 1(b) shows the down-link transmission-paths. In this transmission, the delayed waves due to multi-paths shown by dotted lines are similarly generated. The received waves received by user station u_(o) contain not only an illustrated transmission wave s_(D)(u_(o)) and its delayed wave, but also transmission waves to the other stations u_(k)(k≠0) and their delayed waves.

[0072] When there is an object intercepting the direct wave, demodulation may be performed using one of the delayed waves, instead of using the direct wave, as a principal wave. In this case, some of the interference-waves due to multi-paths precede the principal wave to be demodulated. The following description deals with the system design specifically for the technically more difficult up-link transmission by assuming states where none of preceding waves may take place, for convenience (without loss of generality).

[0073] FIGS. 2 to 4 are explanatory drawings of the first embodiment-example of the invention, indicating the circuit-compositions of the transmitter and the receiver, and the transmission model where spreading sequences generally used, such as Gold sequences, and a frequency-division pilot-frame-transmission-system are used.

[0074]FIG. 2 shows a circuit of the transmitter TX(u_(k)) of the k-th user u_(k). An I-bit binary information-set {b} and a pilot-information p are prepared. The former is converted to a multi-value information-set {β} by means of the illustrated serial-parallel converter s-p, and its output is given as follows

{β}={β₀, β₁, . . . β_(m), . . . β_(M−1)}[β_(m)ε0,±1].  (8)

[0075] The γ components of β_(m) in M components of β_(m) take a value ±1 while the remaining (M−γ) components of β_(m) take the value 0. (Generally, β_(m), can take one of multi-values including 0, real values, complex values, etc. However, for simplicity, it is assumed to take ternary values as stated above.) On the other hand, pilot-information is fixed normally as p=1. For user u_(k), a sequence-population consisting of M kinds of mutually different basic spreading sequences g_(m)(i) is provided. g_(m)(i) is a discrete sequence with length L, as represented by $\begin{matrix} {{g_{m}(i)} = {{\sum\limits_{i = 0}^{L - 1}\quad {g_{m\quad i}{\delta \left( {t - {m\quad T_{c}}} \right)}}} = {\left( {g_{m0},g_{m1},\quad {\ldots \quad g_{m,{L - 1}}}} \right)\quad \left( {{m = {0,\quad 1{,\quad}2}},\quad {{\ldots \quad M} - 1}} \right)}}} & (9) \end{matrix}$

[0076] where, g_(mi) is the i-th chip amplitude, which is assumed here to be a binary value (±1). Generally, it may be given by either a multi-value, a real value, or a complex value. (In this invention, any random sequences can be used.) δ and T_(c) stand for a delta function and a chip period, respectively. A pilot-sequence g_(P)(i) is a similar basic spreading sequence with length L. At respective modulators MOD₀, MOD₁, . . . MOD_(M−1), this basic spreading sequence g_(m)(i) is multiplied by said ternary information β_(m), generating a symbol-frame consisting of L components each with a binary chip impulse (hereinafter, an expression omitting the symbol will be used). By synthesizing these outputs in the adder Σ, the multi-value synthesized impulse-sequence s_(D)(i) consisting of L chips is produced. This output is repeated N-times at an illustrated repeating circuit REP_(D) which generates a repeated core spreading sequence S_(DN)(i) with sequence length L_(G)=NL. Moreover, by copying both the rear portion l(i) and the front portion h (i) of S_(DN)(i) and by adding them to the front and rear sides of S_(DN)(i), respectively, an enveloped frame e_(D)(i) with sequence length L_(E) is produced. The respective chip impulses of e_(D)(i) are applied to a convolutional multiplier COV_(D), where a convolution output with chip-waveform q(t) in Eq. (3) is obtained. This enveloped frame output e_(D)(t) is a baseband transmit data-frame having a continuous time waveform with frame-period T_(E)=L_(E)T_(c) as represented by $\begin{matrix} {{e_{D}(t)} = {\sum\limits_{m = 0}^{M - 1}\quad {\beta_{m}\left\{ {{g_{m}(t)}/T_{E}} \right\}}}} & (10) \end{matrix}$

[0077] where g_(m)(t))/T_(E) is the convolution-output made of both the periodical sequence of g_(m) (i) with sequence-length L_(E) and q (t).

[0078] On the other hand, at modulator MOD_(p), pilot discrete sequence s_(p)(i) is produced, by using pilot-information p and basic spreading sequence g_(p)(i)[i=0,1,2, . . . L−1.]. Moreover, using repeating circuit REP_(p), enveloped circuit ENV_(p), and convolutional multiplier COV_(p), a baseband transmit-pilot-frame is obtained in the same way as stated above, and it is represented by

e _(p)(t)=p{g _(p)(t)/T _(R)}.  (11)

[0079] At illustrated modulators MOD_(fp) and MOD_(fD), (enveloped) data-frame e_(D)(t) modulates a carrier-wave f_(k) while the (enveloped) pilot-frame e_(p)(t) modulates a carrier-wave f_(k)′. Synthesizing of these modulations outputs s_(Da)*(t) and s_(pa)*(t) produces a transmit-frame-output s_(ka)(t) in the radio-band.

[0080]FIG. 3 is a block diagram showing a transmission-path-model. A transmission-path TL_(k) shows the parameter of channel characteristics (transfer function) between the k-th user u_(k) and base station receiver BS. It means that a direct wave which is produced by attenuating transmit-signal s_(ka)(t), and multiple delayed waves generated by multiple propagation paths are produced, and they are applied to BS. All of these waves generated from one transmit-frame are here called a flock-frame. All of TL_(k) outputs are added at a receiving point (represented by Σ), as a consequence, a received frame-signal r_(a)(t) consisting of K flock-frames and the Additive White Gaussian Noise x(t) is produced.

[0081]FIG. 4 shows a receiver circuit R_(x)(u_(o)) to detect the transmitted information of desired station u_(o). D_(p) ⁰ is the generating circuit of a pilot-signal for u_(o), which performs such processing that a baseband signal may be produced by demodulating the received input, and then applies the resultant output to a matched filter to produce a pilot-response. Received input r_(a)(t) is converted into a baseband pilot-flock-frame r_(pf) ⁰(t) (normally, a subscript f is attached to a flock-frame) by means of an illustrated modulator MOD_(fp)′, a low pass filter LPF, and a local carrier-wave {circumflex over (f)}₀′ with a frequency equal to f₀′. [Actually, the real part cos 2π{circumflex over (f)}₀′t and imaginary part sin 2π{circumflex over (f)}₀′t of a carrier-wave are applied to respective modulators MOD_(fpI)′ and MOD_(fpQ)′, and their outputs are applied to respective low pass filters LPF_(I) and LPF_(Q). As a result, a complex output consisting of the real part (I) and the imaginary part (Q) of r_(pf) ⁰(t) can be obtained. Details of the circuit to generate I and Q outputs are omitted for simplicity.] The attenuation and distortion of an waveform which desired station u₀ has transmitted are compensated by an equalizing circuit not illustrated.

[0082] A transmit-wave of respective user stations generates J delayed waves due to multi-paths, including the principal wave (the direct wave or one of the received waves with the maximum power). Therefore, an equalizing circuit output r_(pf) ⁰(t) may contain the baseband transmit-wave e_(p)(t) and its delayed waves. D_(D) ⁰ is a data demodulating circuit similar to D_(p) ⁰. Consider a low pass filter output generated at D_(p) ⁰ and a similar output of D_(D) ⁰. These baseband received waves are given by the following equations, assuming that p=1 $\begin{matrix} {{{r_{p\quad f}^{0}(t)} = {{\sum\limits_{j = 0}^{J - 1}\quad {\mu_{j}^{0}{e_{p}\left( {t - {j\quad T_{C}}} \right)}}} + {x(t)} + {\sum\limits_{k = 1}^{K - 1}{{\hat{r}}_{p}^{k}(t)}}\quad + {\sum\limits_{k = 0}^{K - 1}{{\overset{\hat{\hat{}}}{r}}_{D}^{k}(t)}}}}\quad} & (12) \\ {{{r_{D\quad f}^{0}(t)} = {{\sum\limits_{m = 0}^{M - 1}\quad {\sum\limits_{j = 0}^{J - 1}\quad {{\hat{\mu}}_{j}^{0}\beta_{m}{e_{m}\left( {t - {j\quad T_{c}}} \right)}}}} + {x(t)} + {\sum\limits_{k = 1}^{K - 1}{{\hat{r}}_{D}^{k}(t)}}\quad + {\sum\limits_{k = 0}^{K - 1}{{\overset{\hat{\hat{}}}{r}}_{p}^{k}(t)}}}}\quad} & (13) \end{matrix}$

[0083] where the first terms of both the equations are flock-frames, each consisting of a sum of direct and delayed waves generated by the transmission pilot- or data-frame of user u₀. μ_(j) ⁰ and {circumflex over (μ)}_(j) ⁰ are the signal amplitudes of the j-th delayed wave of the 0-th user and each amplitude takes a complex value consisting of I and Q components due to the phase difference between the transmitted and the local carrier-waves. x(t) is AWGN. r_(a)(t) contains the baseband components transmitted from the other user u_(k)(k≠0) on both carrier-waves f_(k)′ and f_(k), and the pilot- and data-frame components transmitted from u₀ on carrier-waves f₀′ and f₀, respectively. The third and fourth terms of above equations are outputs of inter-station and self-interference components which are obtained by demodulating them with the different orthogonal carrier-waves f₀ and f₀′, as described later. These outputs are made zero due to the above-described demodulation with the orthogonal carrier-waves and an averaging operation performed by an averaging circuit AO in FIG. 4 to be described later. [These outputs may be made zero, instead of using AO, an integrating operation performed by a matched filter MF (z) in FIG. 4 or a correlator C_(or) (y) in FIG. 9.] Therefore, the following description will be made by assuming that these components do not exist.

[0084] Note also that e_(m)(t) in Eq.(13) is an output of e_(m)(i) convoluted with q (t), and e_(m)(i) is an enveloped sequence with sequence length L_(E) which is made by adding a header h (i) and tail l(i) to the core-sequence consisting of N-times repetition of g_(m)(i).

[0085] Although both r_(pf) ⁰(t) and r_(Df) ⁰(t) are frame-waveforms on a continuous time axis, the following demodulation processing is performed after converting them into waveforms taking values in chip spacing T_(c) on a discrete time axis. For this purpose correlation outputs between these continuous waveforms and chip-waveform q(t) are produced at an illustrated chip-waveform correlator C_(or) (q) in every T_(c). [The sampling function waveform is here assumed as q(t). Its time expanse is the integrating time of the correlator, and this time is selected to be sufficiently longer than chip period T_(c) in order to reduce the correlation error.] These correlated outputs become discrete sequences r_(0pf)(i) and r_(ODf)(i), each consisting of chip elements arranged in chip spacing. (The function of this correlator is equivalent to that of a transversal filter with the weighting coefficient of the f-type sampling function.)

[0086] The time position of synchronously received frame-period T_(G)(=L_(G)T_(C)) synchronized to the principal wave of the received signal for the desired station is specified by an illustrated frame pulse e_(F) ⁰. [See FIG. 7(b).] With the gate A and e_(F) ⁰ in the figure, the core sequence portion of the principal wave of received frames r_(pf) ^(o)(i) and r_(Df) ⁰(I) is extracted. These frames are turned into (repeated) synchronously received pilot- and data-frames, r_(pN) ^(0*)(i) and T_(DN) ^(0*)(i) each consisting of L_(G) (=NL) chips. These frames with repeated sequences are applied to two averaging circuits AOs shown in the figure, and AO converts the sequence length of these frames from NL to L chips by means of its averaging operation. Through this operation, two averaging circuits AOs produce synchronously received frames r_(p) ^(0*)(i) and r_(D) ^(0*)(i) each with length L, respectively.

[0087] Pilot-frame r_(p) ^(0*)(i) generated in this manner is applied to a matched filter M_(F)(z) matched to a pilot analyzing sequence z(i), generating a cross-correlation-function {μ⁰} corresponding to desired station u., as the channel-response (equivalent to TL_(o) in FIG. 3) of the transmission-paths. Output {μ⁰} is applied to a fabricated frame generator (FFG) and a synchronizing circuit SYN. The former generates the m-th fabricated pilot-frame r_(pm)*(i) from response {μ⁰} and spreading sequence g_(m)(i). [An illustrated double length frame {r_(pmE)*} whose sequence length is extended to be twice is described later.] M pieces of similar frames {r_(pm)*} are produced, which are applied to a β analyzing circuit.

[0088] Using channel-response {μ⁰}, synchronizing circuit SYN generates the frame pulse e_(F) ⁰ which is used to indicate the position of the synchronously received frame by known means and transmits it to circuits which need the frame pulse. With the aid of this timing, the core-sequence time portion of the principal wave is extracted from r_(a)(t), as described above, to produce baseband outputs r_(pN) ^(0*)(i) and r_(DN) ^(0*)(i). [This system using accurate pilot-responses, do not need to establish carrier-wave-phase-synchronization.]

[0089] A synchronously received data-frame r_(D) ^(0*)(i) with length L is applied, together with a set of r_(pm)*(i), denoted by {r_(pm)*}, to β analyzing circuit β-AYZ. (Circuits SQEX_(P) and SQEX_(D) indicated by dotted line frames in the figure will be described later.)

[0090] Circuit β-AYZ determines an estimate-set {β′} (β₀′, β₁′, β₂′, . . . β_(M−1)′) consisting of the M components of the information the desired station transmitted, using both data-frame r_(D) ^(0*)(i) and pilot-matrix ρ′. ρ′ consists of frame set {r_(pm)*} with a method described later. Moreover, ordinal numbering is newly applied to such γ components of set {β′}, that each may take a value closer to ±1 than those of the other components, generating a set {{circumflex over (β)}^(s)}=({circumflex over (β)}₀ ^(s), {circumflex over (β)}₁ ^(s), . . . {circumflex over (β)}_(γ−1) ^(s)). The figure shows a case with γ=2. By applying {{circumflex over (β)}^(s)} to a multi-value to binary value conversion circuit p-s, a detection output {{circumflex over (b)}}/u₀ corresponding to an information-set {b}/u₀ transmitted from u₀, is generated. In this transmission system assuming (β_(m)ε±1,0), the information quantity I per transmission-frame e_(D)(i) is given as follows

I=γ+log₂(_(M) C _(γ)).  (14-A)

[0091] In the above-described system (A), γ has been fixed. Consider a system with γ not fixed. Let value γ be a natural number less then γ_(max) as the first step, and let γ be components selected from M kinds of sequences as the second step. Consequently, the information quantity of the system is given as follows $\begin{matrix} \left. \begin{matrix} {I = {{\sum\limits_{\gamma = 1}^{\gamma_{\max}}\quad \gamma} + {\log_{2}\left( {{}_{}^{}{}_{}^{}} \right)}}} \\ {\left( {{\gamma = {1,\quad 2}},\quad {\ldots \quad \gamma_{\max}}} \right).} \end{matrix} \right\} & \left( {14\text{-}B} \right) \end{matrix}$

[0092] (To allow γ to have the degree of freedom of γ_(max) or less, highly-accurate interference elimination technology such as this invention is required.) The description here deals mainly with the case where γ is fixed. If multi-values or complex values were to be used, instead of ±1 for β_(m), I would become larger than that obtained from the above equation.

[0093]FIG. 5 shows an auxiliary explanatory drawing of embodiment-example of FIG. 2, indicating a frequency-division frame-composition on the up-link to be used by a user. This transmission-frame is obtained by synthesizing the pilot- and data-frames. The composing method of a frame transmitted by transmitter TX (u_(k)) of the k-th user u_(k)=(k=0,1) is described here, as an example.

[0094] In TX (u_(o)), a basic spreading sequence g_(p)(i)=(g_(p0), g_(p1), . . . g_(pL−1)) for a pilot with length L (chips) and selected spreading sequences g₀ ^(s)(i) and g₁ ^(s)(i) for data are provided. The latter two sequences are γ (≦M, γ=2 in this case) sequences selected from M kinds of basic spreading sequences g_(m)(i)=(m=0.1.2. . . . . M−1) as described above, with the new ordinal numbers and superscript S. By multiplying these spreading sequences by the pilot information p(=1) and data information β₀ ^(s) and βs₁ ^(s) (±1), illustrated sequences pg_(p)(i), β₀ ^(s)g₀ ^(s)(i) and β₁ ^(s)g₁ ^(s)(i) are generated. The former is a basic pilot-frame s_(p)(i). A synthesized sequence with sequence length L, made by summing respective chips of the latter two sequences, is a basic data-frame s_(D)(i).

[0095] Similar sequences illustrated as pg_(p)(i), β₀ ^(s)g₀ ^(s)(i) and β₁ ^(s)g₁ ^(s)(i) are made in TX (u₁). g_(p)(i) in this case is the same as the basic spreading sequence for u₀, but latter two sequences of g₀ ^(s)(i), g₁ ^(s)(i) are normally different from data sequences for u₀. This is because these data sequences correspond to transmission binary information-set {b}/u₀ and {b}/u₁ of u₀ and u₁, respectively. In TX (u_(o)), based on the basic pilot-frame s_(p)(i) common to users, a core-sequence s_(pN)(i)=s_(p)(i)×4 is produced by repeating N times s_(p)(i) (N=4 is set in this case) as shown in the figure. By adding a header sequence hp (i) and a tail sequence l_(p)(i), as guard sequences, to the front and the rear sides of the core-sequence, an enveloped pilot-frame e_(p)(i) is produced. Similarly, an enveloped data-frame e_(D)(i) is produced based on s_(D)(i). By convolutionally modulating said chip-waveform q (t) with these enveloped frame impulse-sequences, baseband enveloped frame waveforms e_(p)(t) and e_(D)(t) are produced, respectively. By modulating carrier-waves f₀′ and f₀ with these enveloped frames, respectively, and by synthesizing these modulated outputs (addition of respective chip-waveforms on the same time axis), a radio-band transmission-frame s_(a) ⁰(t) of u₀ is produced.

[0096] In the similar manner, TX (u₁) produces s_(p) ¹(t) and s_(D) ¹(t). Modulating different orthogonal carrier-waves f₁′ and f₁ with these frames produces a radio-band transmission-frame s_(a) ¹(t) of u₁.

[0097] The sequence length L_(E) (chips) and time width T_(E) of the above enveloped frames are given by the following equations $\begin{matrix} \left. \begin{matrix} {L_{E} = {L_{h} + L_{G} + L_{l}}} \\ {L_{G} = {N\quad L}} \\ {N = {2\quad K}} \end{matrix} \right\} & (15) \end{matrix}$

 T_(E)=L_(E)T_(C)  (16)

[0098] where, L_(h), L_(G), and L_(l) are the sequence lengths of the header, core, and tail, respectively, while N is the number of the basic sequence repetition, and also the number of carrier-waves, while T_(e) is the chip period. In the above example, N=2K=4 has been set for the user population K(=2).

[0099]FIG. 6 is an auxiliary explanatory drawing of FIGS. 2 and 5, indicating the spectrum of core-sequence of the transmit-frame. For example, DFT (Discrete Fourier Transformation) is applied to basic pilot-frame s_(p)(i) with the length of L chips and to core-sequences s_(pN)[=s_(p)(i)×4] with the length of L_(G)(=4L) chips, both of which are elements composing of a transmit-pilot-frame. The principal parts of the resultantly obtained frequency spectrum are of shown in FIG. 6(a). The discrete frequencies f_(D) and f_(G) and the symbol rates f_(s) shown in the figure are given as follows $\begin{matrix} \left. \begin{matrix} {f_{D} = {T_{D}^{- 1} = \left( {L\quad T_{C}} \right)^{- 1}}} \\ {f_{G} = {T_{G}^{- 1} = {\left( {L_{G}T_{C}} \right)^{- 1} = \left( {N\quad L\quad T_{C}} \right)^{- 1}}}} \\ {f_{S} = {T_{E}^{- 1} = \left( {L_{E}T_{C}} \right)^{- 1}}} \end{matrix} \right\} & (17) \end{matrix}$

[0100] where T_(D) and T_(G) are the basic sequence-period and repeated sequence-period respectively. The comb-teeth shaped spectrum of FIG. 6 is an example for a case in which a basic sequence with L=7 is used. As g_(p)(i)[=s_(p)(i)] consists of seven chips [in this case, an f-type sampling function with roll-off factor α=1 is assumed to be used as the chip-waveform q (t).], the spectrum extends up to ±7f_(D) from 0. On the other hand, since core-sequence g_(pN)(i) [=g_(p)(i)×4] consists of 28 chips, the spectrum exists up to ±28f_(G) from 0. [Although the spectra on ±7f_(D) and ±28f_(G) are zero, they are represented by small amplitude in this example.] As both sequences use the same chip period T_(e), the occupied bandwidths are the same. The number of the latter frequency-slots increases by four-fold of the former, and the spectrum exists in one quarter of all the slots, while others are empty slots because of the effect of sequence repetition.

[0101] The spectrum of core-sequence s_(DN)(i) [=s_(D)(i)×4] occupies the comb-tooth shaped frequency-slot similarly. Assuming that f₀₀ is an arbitrary reference-frequency, the following relationship may be applied to said carrier-waves used by u_(k) $\begin{matrix} {\left. \begin{matrix} {f_{k}^{\prime} = {f_{00} + {2\quad k\quad f_{G}}}} \\ {f_{k} = {f_{00} + {\left( {{2k} + 1} \right){f_{G}.}}}} \end{matrix} \right\} \quad \left( {{k = {0,\quad 1{,\quad}2}},\quad {{\ldots \quad K} - 1}} \right)} & (18) \end{matrix}$

[0102] In this case, let us relate the time waveform and the spectrum as follows $\begin{matrix} {{s_{pa}^{k}(t)}{S_{p}^{k}(f)}} \\ {{{s_{Da}^{k}(t)}{S_{D}^{k}(f)}}.} \end{matrix}$

[0103] Thus such a synthesized spectrum is obtained that the spectra of the respective frames may be not mutually overlap, as shown in FIG. 6(b). [s_(p) ⁰(f) is represented by a bold solid line while the spectrum corresponding to each frame is represented by different amplitudes to understand the distinction.]

[0104] Discretely distributed multiplexing on the frequency axis by using carrier-waves with orthogonal frequencies having such relationship as expressed in Eq.(18) is thus provided. As a consequence, the frame components modulated with many different frequencies which are contained in a synchronously received frame with period T_(G) become mutually orthogonal. Therefore, the receiver can perform correlative demodulation so as to separate these frame components.

[0105]FIG. 7 shows an auxiliary explanatory drawing of the embodiment-example of FIGS. 2 and 4, indicating the time sequence drawing of received frames with continuous time waveform. For simplicity, under such assumption that only the pilot-frames among the symbol frames in FIG. 5 are transmitted, the time relationship between a baseband transmit-frame and received frames is shown in FIG. 7. FIG. 7(a) shows the k-th pilot-signals s_(p) ^(k)(t), u_(k)(k=0,1) has transmitted. This is an waveform equivalent to the extended frame e_(p)(t) shown in FIG. 5. The enveloped frames corresponding to a time-sequence-frame-number n shown in the top portion of the drawing is represented by s_(n) ^(k)(t)(k=0,1, n=0,1, . . . ) where subscript p is omitted. The time difference τ₀₁ ^(s) between s_(p) ⁰(t) and s₁ ⁰(t) is controlled with a down-link control channel, so that the receiving time difference τ₀₁ ^(R) may become smaller in the receiver.

[0106]FIG. 7(b) shows the flock-frames r_(pf) ^(k)(t) received in correspondence with transmitted pilot-signals s_(p) ^(k)(t) in FIG. 7(a). The flock-frame shown in the figure, as an example, consists of the principal wave μ₀ ^(k)r_(p) ^(k)(t) and the delayed waves, μ₁ ^(k)r_(p) ^(k)(t−T_(c)) and μ₂ ^(k)r_(p) ^(k)(t−2T_(c)), which are received at timings delayed by T_(c) and 2T_(c) seconds from the principal wave. μ_(j) ^(k)(j=0, 1, 2, . . . J−1. J=3 in this case) is the complex amplitude of the principal wave and delayed waves obtained by demodulating the received wave with the pilot carrier-wave of the desired station. [In practice, a delayed wave is received at a delayed timing equivalent to a real-value multiple times of T_(c). As this wave can be converted into a sum of plural delayed frames each consisting of sampled values obtained by correlator C_(or)(q) in FIG. 4, at time position jT_(c), that is integer multiples of T_(c). Therefore, correct demodulation can be performed by analytically processing this converted output. For this reason, this example shows only waves with delay times of integer multiple.]

[0107] In FIG. 7, let us notice the first (n=0) frame, one can find that the time range of the core-sequence of the enveloped principal wave frame μ₀ ⁰r₀ ⁰(t) received from desired station u_(o) is designated by a synchronously received frame-pulse e_(F) ⁰. Signals received with this timing (all the signals enclosed by the dotted line frames) are denoted by r_(p0) ^(0*)(t). e_(F) ⁰ shown in the lower part of the figure is generated in the synchronizing circuit of the receiver shown in FIG. 4. Pilot-frame r_(p0) ^(0*)(t) is extracted and analyzed as described later.

[0108] A time difference τ_(s) shown in FIG. 7(b) is the difference between the received frame (principal wave) of the desired station and the wave incoming with the maximum delay (or advance) (the frame delayed by 2T_(c) sec in this figure) among the self-interference-waves. τ₁ is the similar time difference from the wave incoming with the maximum delay (or advance) among the inter-station interference-waves. τ₁ contains also the delay τ₀₁ ^(R) between principal waves as above-described. Here, the time width for the header and the tail is set as follows $\begin{matrix} \left. \begin{matrix} {T_{h},{\geqq \tau_{s}},\tau_{I}} & \left( {\tau_{s},{\tau_{I} > 0}} \right) \\ {T_{l},{\geqq {- \tau_{s}}},{- \tau_{I}}} & {\left( {\tau_{s},{\tau_{I} < 0}} \right).} \end{matrix} \right\} & (19) \end{matrix}$

[0109] As τ_(s) and τ₁ are determined by the cell radius and topography, T_(h) and T₁ can be designed to meet the above equation. [Note that r₀ ⁰(t) is used as a time reference. Therefore, negative-polarity τ_(s) and τ₁ may occur, if there are any interfering waves coming in advance to r₀ ⁰(t) or self-preceding waves r₀ ⁰(t+T_(c)), because in the time difference calculation, r₀ ⁰(t) is used here as a reference. The time width T₁ of the tail plays a role of guard sequence against such negative-polarity time difference.]

[0110]FIG. 7(b) shows a case in which a quasi-synchronization-condition as above-described is satisfied. In this case, both interference components, such as μ₁ ⁰r₀ ⁰(t−T_(c)) and μ₂ ¹r₀ ¹(t−2T_(c)) contained in the synchronously received frame r_(p0) ^(0*)(t), are sequences made by multiplying cyclically shifted sequences of the core-sequence-portions (period T_(G)) of s₀ ⁰(t) or s₀ ¹(t) by the complex amplitude. If Eq.(19) is not satisfied, the slant portion in r_(p0) ^(0*)(t) generally results in containing the tail or header of an preceding (n=−1) or succeeding (n=1) frame carrying different information [β₀ ^(s), etc.] from that of the desired station or the interference station. In consequence, interference components fail to become simple N-time repeated sequences of a certain sequence, so that the orthogonal relationship on the frequency axis explained in FIG. 6 is lost. Namely, if Eq. (19) is satisfied and, as a result, the boundary F_(B) of information modulation of flock-frames received from the desired station or an interference station is not contained in r_(p0) ^(0*)(t), an orthogonal relationship due to the orthogonal carrier-waves is established between the components of synchronously received frames of r_(pf) ⁰(t) and r_(pf) ¹(t), so that existence of preceding and succeeding frames can be ignored during demodulation of r_(p0) ^(0*)(t). This means that there is no interference from other stations. For the same reason, by assuming that the data-frame is transmitted within the same time span from u_(o), the synchronously received data-frame r_(D) ^(0*)(t) is obtained in the same manner. Even if this component is contained in the same synchronously received frame-period as that of r_(p0) ^(0*)(t), mutual orthogonal relationship is established, because the component exist on the frequency-slot corresponding to the different frequency f₀, and both components are the similar repeated sequences. Therefore, the synchronously-received pilot- and data-frames of the same user can be separated in the demodulating analysis. According to this principle, the receiver can obtain isolated pilot-responses so as not to be affected by the interference disturbance as described later.

[0111]FIG. 8 is an auxiliary explanatory drawing of FIG. 7, which is the detailed drawing of baseband transmit and received symbol-frames of a single user. Therefore, this drawing provides description while omitting the superscript indication of the user number k and the time sequence ordinal number n. FIG. 8(a) shows the enveloped pilot-frame e_(p)(i) and the corresponding received flock-frame r_(pf)(i) as explained in FIG. 5. Assuming that N=4, the core-sequence of enveloped sequence e_(p)(i) is pg_(pN)(i) [=s_(p)(i)×4], while the header h_(p)(i) and tail l_(p)(i) are also contained in e_(p)(i). Generally, the repeated sequence r_(pN)*(i) is given by the following equation $\begin{matrix} \left. \begin{matrix} \begin{matrix} {{r_{pN}^{*}(i)} = {{\sum\limits_{j = 0}^{J - 1}\quad {\mu_{j}{g_{pN}\left( {i - j} \right)}}} + {x_{p}(i)}}} \\ {= \left( {{\overset{\_}{\rho}}_{00}^{\prime},{\overset{\_}{\rho}}_{01}^{\prime},\quad {\ldots \quad {\overset{\_}{\rho}}_{L - 1}^{\prime}},{\overset{\_}{\rho}}_{11}^{\prime},\quad {\ldots \quad {\overset{\_}{\rho}}_{1,{L - 1}}^{\prime}},\quad {\ldots \quad {\overset{\_}{\rho}}_{{N - 1},{L - 1}}^{\prime}}} \right)} \end{matrix} \\ {\quad \left( {{i = 0},1,{{2,\quad \ldots \quad N\quad L} - 1}} \right)} \end{matrix} \right\} & (20) \end{matrix}$

[0112] where, {overscore (ρ)}_(s,i)′ indicates the i-th (=0,1,2, . . . L−1) chip amplitude in the s-th (=0,1,2, . . . N−1) unit sequence which is made by repeating N-times one unit (basic) sequence with L chips. Prime symbol ′ indicates what contains of a deviation due to AWGN. Here i and j are used to represent the discrete value of the time variable t=iT_(c) and the delay time variable τ=jT_(c). This example received frame consists of three waves in correspondence with J=3. [For r_(pf)(i), and r_(Df)(i) to be described later, the symbol indication of the header and tail in the drawing is omitted.] Note also that x_(p)(i) is AWGN.

[0113]FIG. 8(b) shows enveloped data-frame e_(D)(i) shown in FIG. 5 and flock-frame r(i) corresponding to this frame. g_(0N) ^(S)(i) is the sequence obtained by repeating the 0-th selected basic spreading sequence by N times. The difference from FIG. 8(a) is that each wave is composed of a sum of two sequences in correspondence to γ=2. Therefore, in this example, the components of synchronously received data-frame r_(DN)*(i) received on the synchronously received period denoted by r_(p0)*(t) in FIG. 7 are of NL chips consisting of γJ=6 sequences. Assuming {circumflex over (μ)}_(j) be the complex amplitude of the j-th delayed wave of the data-frame delayed by jT_(c), and x_(D)(i) be AWGN, r_(DN)*(i) is given by the following equation: $\begin{matrix} \left. \begin{matrix} {{{r_{DN}^{*}(i)} = {{\sum\limits_{m = 0}^{M - 1}\quad {\sum\limits_{j = 0}^{J - 1}\quad {{\hat{\mu}}_{j}\beta_{m}{g_{mN}\left( {i - j} \right)}}}} + {x_{D}(i)}}}\quad} \\ {\quad {= \left( {{\overset{\_}{d}}_{00}^{\prime},{\overset{\_}{d}}_{01}^{\prime},\quad {\ldots \quad {\overset{\_}{d}}_{0,{L - 1}}^{\prime}},{\overset{\_}{d}}_{10}^{\prime},{\overset{\_}{d}}_{11}^{\prime},\quad {\ldots \quad {\overset{\_}{d}}_{1,{L - 1}}^{\prime}},\quad {\ldots \quad {\overset{\_}{d}}_{{N - 1},{L - 1}}^{\prime}}} \right)}} \end{matrix} \right\} & (21) \end{matrix}$

[0114] where, {overscore (d)}_(s,i)′ indicates the i-th component of the s-th unit sequence, similarly to the case of {overscore (p)}_(s,i)′. Both frames r_(DN)′(i) and r_(pN)′(i) are produced by repeating N-times a unit sequence with L chips. Therefore, by averaging N same chip components on the unit sequences concerned, they can be converted in to components composed of L chips. (The noise power reduces 1/N fold.) Accordingly, at averaging circuit A0s contained in D_(p) ⁰ and D_(D) ⁰ of FIG. 4, r_(pN)*(i) and r_(DN)*(i) with NL chips can be converted into synchronously received pilot- and data-frames, each consisting of L chips, by carrying out an averaging operation given by the following equations $\begin{matrix} \left. \begin{matrix} {\rho_{i}^{\prime} = {\frac{1}{N}{\sum\limits_{S = 0}^{N - 1}\quad {\overset{\_}{\rho}}_{S,i}^{\prime}}}} \\ {d_{i}^{\prime} = {\frac{1}{N}{\sum\limits_{S = 0}^{L - 1}{{\overset{\_}{d}}_{S,i}^{\prime}.}}}} \end{matrix} \right\} & (22) \end{matrix}$

[0115] [This averaging operation can be included in the solution processing of Eq. (29) or the correlation processing of Eq. (25) to be described later. Note also that the component shown with the third and fourth terms in, Eqs.(12) and (13) becomes zero through this averaging operation.] $\begin{matrix} {{r_{p}^{*}(i)} = {{{\sum\limits_{j = 0}^{L - 1}\quad {\mu_{j}{g_{p}\left( {i - j} \right)}}} + {x_{p}(i)}} = \left( {\rho_{0}^{\prime},\rho_{1}^{\prime},\quad {\ldots \quad \rho_{L - 1}^{\prime}}} \right)}} & (23) \\ {{{r_{D}^{*}(i)} = {{{\sum\limits_{m = 0}^{M - 1}\quad {\sum\limits_{j = 0}^{J}\quad {{\hat{\mu}}_{j}\beta_{m}{g_{m}\left( {i - j} \right)}}}} + {x_{D}(i)}} = {\left( {d_{0}^{\prime},d_{1}^{\prime},\quad {\ldots \quad d_{L - 1}^{\prime}}} \right).}}}\quad} & \left( {24\text{-}A} \right) \end{matrix}$

[0116] Comparing Eqs.(23) and (24), and noticing that μ_(j) and {circumflex over (μ)}_(j) (j=0,1,2) can be converted mutually, and β_(m) ^(s)=±1 hold good for p=1, one can find that the value of β_(m) ^(s) may be obtained by analyzing r_(D)*(i) with r_(p)*(i). The specific approach is described.

[0117] The matched filter MF(z) in FIG. 4 is of matched to a sequence z(i). z(i) is a pilot analyzing sequence with sequence length L, and it satisfies the following cyclic cross correlation function R_(pz) $\begin{matrix} \left. \begin{matrix} {{R_{pz}(\tau)} = {{\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}\quad {{g_{p}(i)}\overset{\_}{z\left( {i - \tau} \right)}}}} = 1}} & {\tau = 0} \\ {\quad {= 0}} & {\tau \neq 0} \end{matrix} \right\} & (25) \end{matrix}$

[0118] where g_(p)(i) is a basic spreading sequence for pilot, while ⁻ is a symbol denoting the complex conjugate. A cyclic cross-correlation-function {μ} between this pilot analyzing sequence z(i) and synchronously received pilot-frame r_(p)*(i) which omits the subscript of user number k is a channel-response representing the transmission-path characteristics, and it is given by the following equation, assuming AWGN is zero (x(i)=0) $\begin{matrix} \left. \begin{matrix} {\mu_{j} = {\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}\quad {{r_{p}^{*}(i)}\overset{\_}{z\left( {i - j} \right)}\quad \left( {{J < L},{j = 0},1,{{2,\quad \ldots \quad J} - 1}} \right)}}}} \\ {\left\{ \mu \right\} = {{\sum\limits_{j = 0}^{J - 1}\quad {\mu_{j}{\delta \left( {i - j} \right)}}} = \left( {\mu_{0},\mu_{1},\quad {\ldots \quad \mu_{J - 1}}} \right)}} \end{matrix} \right\} & \left( {26\text{-}A} \right) \end{matrix}$

[0119] where μ_(j) is the received frame amplitude delayed by jT_(c) from the direct wave, as shown in FIGS. 7(b) and 8(b), and it takes generally a complex value. For J≧L, the above equation is expressed as follows, because the delayed wave delayed by nLT_(c)(n=0,1,2, . . . ) is detected in an overlapped manner $\begin{matrix} \left. \begin{matrix} {\left\{ \mu \right\} = {\left( {\mu_{0}^{\prime},\mu_{1}^{\prime},\quad {\ldots \quad \mu_{L - 1}^{\prime}}} \right)\quad \left( {J \geq L} \right)}} \\ {\mu_{j}^{\prime} = {\sum\limits_{n = 0}^{N^{\prime}}\quad {\mu_{j + {n\quad L}}\quad \left\{ {{N^{\prime} = \left\lbrack {J/L} \right\rbrack},{j = 0},1,{{2,\quad \ldots \quad L} - 1}} \right\}}}} \end{matrix} \right\} & \left( {26\text{-}B} \right) \end{matrix}$

[0120] where [ ] is Gauss symbol. Thus, the channel-response {u^(k)} which corresponds to the transmission-path characteristics TL_(k) in FIG. 2 without being affected by disturbance of the interference-waves may be obtained under conditions in Eqs. (18) and (19), by the aid of the isolated pilot. [However, this response is disturbed by AWGN. Besides, the output {u⁰} of MF(z) in FIG. 4 corresponds to TL₀ in FIG. 3]

[0121] Now, let us fabricate (synchronously received) fabricated pilot-frame r_(pm)*(i), which would be obtained when a pilot-frame were to be transmitted using a basic spreading sequence g_(m)(i) for data, instead of using basic spreading sequence g_(p)(i) for pilot. This response is L chip components which are produced from both modified response {{circumflex over (μ)}} to be described later, and g_(m)(i) at a fabricated frame generator FFG in FIG. 4, as expressed by $\begin{matrix} {{r_{pm}^{*}(i)} = {{{\sum\limits_{j = 0}^{J - 1}\quad {{\hat{\mu}}_{j}{g_{m}\left( {i - j} \right)}}} + {x_{p}(i)}} = \left( {\rho_{m0}^{\prime},\rho_{m1}^{\prime},\quad {\ldots \quad \rho_{m,{L - 1}}^{\prime}}} \right)}} & (27) \end{matrix}$

[0122] where ρ_(mi)(i=0,1,2, . . . L−1) is the i-th chip amplitude and prime symbol ′ indicates that the deviation caused by AWGN is included.

[0123] Assume here that enveloped pilot-frame e_(p)(i) has been transmitted simultaneously using carrier-waves for pilot and data, f_(k)′ and f_(k), as shown in Eq. (18). The receiver is assumed to demodulate the received frame with the local carrier-waves {circumflex over (f)}_(k)′ and {circumflex over (f)}_(k), generating synchronously received frames r_(p)*(i) and r_(D)*(i) in Eq. (23) and (24). These frames are assumed to be applied respectively to two matched filters MF(z) similar to those shown in FIG. 4, producing correlation function outputs {μ} and {{circumflex over (μ)}} as expressed by Eq. (26). In this case, there exists the following relationship between j-th components of these outputs. $\begin{matrix} \left. \begin{matrix} {{\hat{\mu}}_{j} = {\mu \quad {\exp \left( \sqrt{{- j}\quad \theta} \right)}}} \\ {\theta = {2\quad \pi \quad f_{G}j\quad T_{c}}} \end{matrix} \right\} & (28) \end{matrix}$

[0124] In this case, f_(G) is the shift frequency in Eq. (17) while jT_(c) is the delay time of the j-th delayed wave. When carrier-waves carrying the signal have different frequencies, a phase rotation θ takes place in their channel-response. Therefore, when producing fabricated pilot-frame r_(pm)*(i) to analyze data-frame r_(D)*(i), the corrected response {{circumflex over (μ)}} must be used.

[0125] [Direct Analysis Method]

[0126] The data-frame in Eq. (24-A) is represented by means of the fabricated pilot-frame in Eq. (27), as follows $\begin{matrix} {{r_{D}^{*}(i)} = {{{\sum\limits_{m = 0}^{M - 1}{\beta_{m}{r_{pm}^{*}(i)}}} + {x_{D}^{\prime}(i)}} = \left( {d_{0}^{\prime},d_{1}^{\prime},{\ldots \quad d_{L - 1}^{\prime}}} \right)}} & \text{(24-B)} \end{matrix}$

[0127] where, x_(D)′(i) is AWGN generated based on x_(D)(i) and x_(p)(i) in Eqs. (24) and (27). Considering that β_(m) consists of M components, the pilot-frame may be rewritten as follows by using an expression with transposed elements in Eq. (27) (changing the subscript order) $\begin{matrix} \left. \begin{matrix} {{\left\lbrack \rho^{\prime} \right\rbrack \left\lbrack \beta^{\prime} \right\rbrack} = \left\lbrack d^{\prime} \right\rbrack} \\ {{\begin{pmatrix} \rho_{00}^{\prime} & \rho_{01}^{\prime} & \cdots & \rho_{0m}^{\prime} & \cdots & \rho_{0,{M - 1}}^{\prime} \\ \rho_{10}^{\prime} & \rho_{11}^{\prime} & \cdots & \rho_{1m}^{\prime} & \cdots & \rho_{1,{M - 1}}^{\prime} \\ \vdots & \vdots & \quad & \vdots & \quad & \vdots \\ \rho_{n0}^{\prime} & \rho_{n1}^{\prime} & \cdots & \rho_{n0}^{\prime} & \cdots & \rho_{n,{M - 1}}^{\prime} \\ \vdots & \vdots & \quad & \vdots & \quad & \vdots \\ \rho_{{L - 1},0}^{\prime} & \rho_{{L - 1},1}^{\prime} & \cdots & \rho_{{L - 1},i}^{\prime} & \cdots & \rho_{{L - 1},{M - 1}}^{\prime} \end{pmatrix}\begin{pmatrix} \beta_{0}^{\prime} \\ \beta_{1}^{\prime} \\ \vdots \\ \beta_{n}^{\prime} \\ \vdots \\ \beta_{L - 1}^{\prime} \\ \beta_{L}^{\prime} \\ \vdots \\ \beta_{M - 1}^{\prime} \end{pmatrix}} = \begin{pmatrix} d_{0}^{\prime} \\ d_{1}^{\prime} \\ \vdots \\ d_{n}^{\prime} \\ \vdots \\ d_{L - 1}^{\prime} \end{pmatrix}} \end{matrix} \right\} & (29) \\ \left. \begin{matrix} {\rho_{n\quad m}^{\prime} = {\rho_{n\quad m} + {\Delta \quad \rho_{n\quad m}}}} \\ {\beta_{n}^{\prime} = {\beta_{n} + {\Delta \quad \beta_{n}}}} \\ {d_{n}^{\prime} = {d_{n} + {\Delta \quad d_{n}}}} \end{matrix} \right\} & (30) \end{matrix}$

[0128] where, ρ′, β′, and d′ are respectively the pilot matrix with size (L×M) consisting of ρ_(nm)′ as the element on the n-th column and the m-th row, an unknown matrix consisting of β_(n)′ as the element, and the received data-matrix consisting d_(n)′ as the element. [Each column of ρ′ and d′ contains (M−γ) elements taking the value 0.] Prime symbol ′ indicates what deviated components (Δ_(pvm), Δβ_(n), Δd_(n)) due to AWGN shown in Eq. (30) are contained. The method of detecting the transmitted information by solving Eq. (29) is called a direct analysis method.

[0129] [Maximum Likelihood Judgment Method]

[0130] Normally, the solution can be obtained for Eq. (29) when M≦L. Even when M>L, the solution can be obtained according to a method such as the maximum likelihood solution, as long as γ≦L, considering that (M−γ) elements among M elements consisting of unknown set {β} takes zero. Three methods to obtaine the maximum likelihood solution are specifically described as follows.

[0131] Solution (a):

[0132] Decrease M unknown variables in Eq. (29) and select an optional integer M_(R) that satisfies the following equation. $\begin{matrix} \left. \begin{matrix} {M > M_{R} \geq \gamma} \\ {M_{R} \leq {L.}} \end{matrix} \right\} & (31) \end{matrix}$

[0133] Let the 0-th arrangement-set among N, reduced size unknown sets be {β^(R)}₀=(β₀ ^(R), β₁ ^(R), . . . β_(m) . . . β_(M) _(R) ⁻¹ ^(R)), and N_(R) is given by

N_(R)=_(M)C_(M) _(R) .  (32)

[0134] Prepare similarly N_(R)(=_(M)C_(M) _(R) ) sets {β^(R)}_(v)(v=0,1,2, . . . N_(R)−1). In this case, the reduced size system of linear equations (with M_(R) unknowns) holds good as follows, where the size of Eq. (29) is reduced to (M_(R)×M_(R)) for {β_(R)}. $\begin{matrix} {{\begin{pmatrix} \rho_{00}^{\prime} & \rho_{01}^{\prime} & \cdots & \rho_{0,{M_{R} - 1}}^{\prime} \\ \rho_{10}^{\prime} & \rho_{11}^{\prime} & \cdots & \rho_{1,{M_{R} - 1}}^{\prime} \\ \vdots & \vdots & \quad & \vdots \\ \rho_{{M_{R} - 1},0}^{\prime} & \rho_{{M_{R} - 1},1}^{\prime} & \cdots & \rho_{{M_{R} - 1},{M_{R} - 1}}^{\prime} \end{pmatrix}\begin{pmatrix} \beta_{0}^{\prime} \\ \beta_{1}^{\prime} \\ \vdots \\ \beta_{M_{R}}^{\prime} \end{pmatrix}} = {\begin{pmatrix} d_{0}^{\prime} \\ d_{1}^{\prime} \\ \vdots \\ d_{M_{R} - 1}^{\prime} \end{pmatrix}.}} & (33) \end{matrix}$

[0135] Generally, the solution of above equation is obtained under a condition that M_(R) satisfies Eq. (29).

[0136] When all of γ components of selected information were to be contained in set {β^(R)}₀ stated above, the solution {β^(R′)}₀ of Eq. (33) would take the maximum likelihood solution ({β^(R)}₀ ^(H)) that is one of correct combinations [such combinations, that γ elements in the above reduced unknown sets {β^(R)}₀ take ±1, while the remaining (M_(R)−γ) elements take 0]. If it is not satisfied, the above solution takes considerably different values from any combination of the correct values. Let us define deviations representing the distance between the m-th unknown (solution) β_(m) ^(R′) among M_(R) elements of {β^(R′)}₀ composing of a solution of Eq. (33) and the transmitted information β_(m)=0, ±1 by the following equations $\begin{matrix} \left. \begin{matrix} {\Delta_{m0} = {\beta_{m}^{R^{\prime}}}} \\ {\Delta_{m +} = {{{\hat{\alpha}}_{m}^{R^{\prime}} - 1}}} \\ {\Delta_{m -} = {{{{\hat{\alpha}}_{m}^{R^{\prime}} + 1}}.}} \end{matrix} \right\} & (34) \end{matrix}$

[0137] Here, the minimum value of the three deviations for one unknown solution is taken and represented as Δ_(m) ^(A)(εΔ_(m+), Δ_(m−)) or Δ_(m) ^(B)(εΔ_(m0)). Let us align Δ_(m) ^(A), and Δ_(m) ^(B) in the order from small to large, respectively, provide new superscripts A and B with respective values, provide individual ordinal numbers n=(1,2, . . . ) with the elements composing of respective sets, and represent these deviation sets as {Δ^(A)}₀={Δ₀ ^(A)

Δ₁ ^(A) . . .

Δ_(γ−1) ^(A)}₀, sets {Δ^(B)}₀={Δ₀ ^(B)

Δ₁ ^(B) . . .

Δ_(M) _(R) _(−γ−1) ^(B)}. Then, prepare the other unknown {β_(R)}_(v)(v≠0), and determine the similar deviation sets {Δ^(A)}_(v) and {Δ^(B)}_(v) from the respective sets. For these deviation sets, as a deviation evaluation function, a following algebraic sum of constituent elements is calculated $\begin{matrix} {S_{v} = {{\sum\limits_{n = 0}^{\gamma - 1}\Delta_{n}^{A}} + {\sum\limits_{n = 0}^{M_{R} - \gamma - 1}{\Delta_{n}^{B}\quad\left\lbrack {{\Delta_{n}^{A} \in \left\{ \Delta_{n}^{A} \right\}_{v}},{\Delta_{n}^{B} \in \left\{ \Delta_{n}^{B} \right\}_{v}}} \right\rbrack}}}} & (35) \end{matrix}$

[0138] This is the evaluation function for v being fixed. (Such candidates that the number of members composing Δ_(n) ^(A) takes a number other than γ should be excluded.) For N_(R) unknown sets, the similar evaluation functions are obtained. If S_(v′) of these sets takes the minimum value, then said unknown set {β^(R′)}_(v′) is obtained as the maximum likelihood set {β^(R)}_(v′) ^(H). By making hard decisions whether this set is positive or negative, the detected set {{circumflex over (β)}^(s)}=({circumflex over (β)}₀ ^(s), {circumflex over (β)}₁ ^(s), . . . {circumflex over (β)}_(γ−1) ^(s)) corresponding to {β^(s)} is obtained. Applying {{circumflex over (β)}^(s)} to a parallel to serial converter p−s in FIG. 2(c) produces detected output {{circumflex over (b)}} corresponding to the transmitted binary set.

[0139] For a case of γ being not fixed, {{circumflex over (β)}^(S)} may be determined based on γ which satisfies the following equation $\begin{matrix} \left. \begin{matrix} {\gamma \leqq \gamma_{m}} \\ {{\left( {\Delta_{\gamma - 1}^{A} - \Delta_{\gamma - 2}^{A}} \right)/\left( {\Delta_{\gamma}^{A} - \Delta_{\gamma - 1}^{A}} \right)}1.} \end{matrix} \right\} & (36) \end{matrix}$

[0140] Solution (b):

[0141] Select sets U_(s)(s=0,1,2, . . . N−1), each consists of y pieces of M fabricated pilot-frames r_(pm)′. There are N_(n)=_(M)C_(γ) sets as the possible combinations. On condition of excluding the case of all polarity inversion, 2^(γ−1) pieces of virtual (transmitted information) sequences C_(h)(=c₀, c₁, . . . c_(γ−1)), each consisting of γ elements which take +1 or −1 can be produced. By multiplying the element frame consisting of each set of U_(s) by the element (polarity) of C_(h) sequentially, plural pieces of receivable fabricated transmission-frames F_(sh) are generated. This combination amounts to 2^(γ−1)N_(n), in excluding the case of polarity inversion. For simplicity, a case for M=4 and γ=2 is explained as follows.

[0142] As the fabricated pilot-frames in this case are r_(pm)*(i)(m =0,1,2,3), let one set selected from those frames be U₀[γ_(p0)*,r_(p1)*] according to y=2. As a result, fabricated transmission-frames F_(sh)(i) are given by the following equations, based on U₀ and C_(h), where two virtual sequences C₀(=1,1) and C₁(1,−1) exist $\begin{matrix} \left. \begin{matrix} {{F_{00}(i)} = {\left\lbrack {U_{0}/C_{0}} \right\rbrack = {r_{p0}^{*} + r_{p1}^{*}}}} \\ {{F_{01}(i)} = {\left\lbrack {U_{0}/C_{1}} \right\rbrack = {r_{p0}^{*} - {r_{p1}^{*}.}}}} \end{matrix} \right\} & (37) \end{matrix}$

[0143] Similarly, fabricated transmission-frames are obtained for the other sets U₁ to U₃, producing eight frames in total. The 0-shift-correlation value between synchronously received data-frame and each of the fabricated transmission-frames is given by $\begin{matrix} {R_{sh} = {\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}{{{r_{D}^{*}(i)} \cdot {\overset{\_}{F_{sh}}(i)}}\quad \left( {{s = 0},1,{\ldots \quad 3},{h = 0},1} \right)}}}} & (38) \end{matrix}$

[0144] Among the eight frames, a fabricated transmission-frame whose R_(Sh) takes a value closest to ±1 is identified using the following evaluation functions $\begin{matrix} \left. \begin{matrix} {S_{{sh} +} = {{R_{sh} - 1}}} \\ {S_{{sh} -} = {{{R_{sh} + 1}}.}} \end{matrix} \right\} & (39) \end{matrix}$

[0145] The subscript s of S_(shx) determines β_(m) corresponding to the combination and order of r_(pm)*(i), while h and +, − determine the polarity of {circumflex over (β)}_(m). For example, if the evaluation function taking the minimum value is S₀₀₊ or S⁰¹⁻, the detected value of the transmitted information {{circumflex over (β)}^(S)}=({circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S)) may be obtained from the following relationship $\begin{matrix} \left. \quad \begin{matrix} {\left. S_{00 +}\rightarrow{\min \text{:}} \right.\quad} & {{\hat{\beta}}_{0} = {{\hat{\beta}}_{1} = 1}} \\ \left. S_{01 -}\rightarrow{\min \text{:}} \right. & {{\hat{\beta}}_{0} = {{- {\hat{\beta}}_{1}} = {- 1.}}} \end{matrix} \right\} & (40) \end{matrix}$

[0146] Solution (c)

[0147] Derive an analyzing sequence w_(m)(i) that satisfies the following equation, in which the 0-shift-correlation value between w_(m)(i) and fabricated pilot-frame r_(pm)*(i) in Eq.(27) takes 1, while the 0-shift-correlation value between w_(m)(i) and each of M_(T)(γ<M_(T)≦M−1) pieces of r_(pm′)(i)(m′≠m) takes 0: $\begin{matrix} \left. \begin{matrix} {{\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}\quad {{r_{pm}^{*}(i)} \cdot \overset{\_}{w_{m}(i)}}}} = 1} \\ {{\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}\quad {{r_{{pm}^{\prime}}^{*}(i)} \cdot \overset{\_}{w_{m}(i)}}}} = {{0\quad\left\lbrack {m,{m^{\prime} \in 0},1,2,\quad {\ldots \quad M}} \right\rbrack}\quad\left\lbrack {m^{\prime} \neq m} \right\rbrack}} \end{matrix} \right\} & (41) \end{matrix}$

[0148] Since r_(pm)*(i) has L chips in length, w_(m)(i) also takes L in length. Considering [m=0,m′ε0,1,2, . . . M_(T),M_(T)≦(L−1))<M] as an example of the combination, the following equation is obtained using the transposed sequence an analyzing sequence w₀(i)=(w₀₀, w₀₁, . . . w_(0,L−1))^(T) $\begin{matrix} \left. {{\begin{pmatrix} \rho_{00}^{\prime} & \rho_{01}^{\prime} & \cdots & \rho_{0,{L - 1}}^{\prime} \\ \rho_{10}^{\prime} & \rho_{11}^{\prime} & \cdots & \rho_{1,{L - 1}}^{\prime} \\ \vdots & \vdots & \quad & \vdots \\ \rho_{M_{T},0}^{\prime} & \rho_{M_{T},1}^{\prime} & \cdots & \rho_{M_{T},{L - 1}}^{\prime} \end{pmatrix}\quad \begin{pmatrix} w_{0}^{\prime} \\ w_{1}^{\prime} \\ \vdots \\ w_{L - 1}^{\prime} \end{pmatrix}} = \begin{pmatrix} 1 \\ 0 \\ \vdots \\ 0 \end{pmatrix}} \right\} & (42) \end{matrix}$

[0149] shown in

[0150] where ρ_(mn)′ is the element used without transposing that given by Eq.(27). For m fixed, produce multiple combinations of m′, that is denoted by [m′], amounting to N_(m′)=[(M−1)/(M−1−M_(T))]+1, ([ ] is a Gauss symbol). Let w_(m[m′])(i) be the analyzing sequence corresponding to each of the combinations. Thus, N_(m′) analyzing sequences stated above can cover the (M−1) kinds of sequence areas. Using these sequences, the 0-shift-correlation value given by the following equation is obtained $\begin{matrix} \left. \begin{matrix} {R_{m{\lbrack m^{\prime}\rbrack}} = {\frac{1}{L}{\sum{{r_{D}^{*}(i)} \cdot \overset{\_}{w_{m{\lbrack m^{\prime}\rbrack}}(i)}}}}} & {m = \left( {0,1,2,\quad {{\ldots \quad M} - 1}} \right)} \\ \quad & {{\left\lbrack m^{\prime} \right\rbrack = \left\lbrack 1^{\prime} \right\rbrack},\left\lbrack 2^{\prime} \right\rbrack,\quad {{\ldots \quad\left\lbrack {N^{\prime}m^{\prime}} \right\rbrack}.}} \end{matrix} \right\} & (43) \end{matrix}$

[0151] If all of γ components of transmitted information {β^(s)} is contained in β_(m) and β_([m′]), these correlation values indicate values extremely close to ±1. Therefore, by identifying a set of γ components taking the nearest correlation values to ±1 among R_(m[m′]) determined for all of MN_(m′) combinations, as the maximum likelihood set, using the evaluation function similar to that in Eq.(39), the respective γ correlation values R_({circumflex over (m)}[m′])({circumflex over (m)}=0,1,2, . . . γ−1) become the maximum likelihood solution. The detected values of the transmitted information {{circumflex over (β)}^(s)}=({circumflex over (β)}₀ ^(s), β₁ ^(s), . . . {circumflex over (β)}_(γ−1) ^(s)) can be determined by making these solutions on the hard decision.

[0152] [Correlation Analysis Method]

[0153] Instead of analyzing r_(D)*(i) in Eq. (24) with r_(pm)*(i) in Eq. (27), both of them are subject to correlative analysis with an identical analyzing sequence y_(m)(i) and the outputs may be used to establish a system of linear equations. The partial circuit of a receiver of the second embodiment-example using this correlation analysis method is shown in FIG. 9. This partial circuit corresponds to the rear part in FIG. 4. In Fig. (a), output r_(pm)* of fabricated frame generator FFG is the fabricated pilot-frame in Eq. (27). Consider a case where a data analyzing sequence y_(m)(i) is generated such that the conditions given to the cyclic cross-correlation-function represented by the following equation may be satisfied in the process of y-AYZ in the figure $\begin{matrix} \left. \begin{matrix} {{R_{my}\quad (\tau)} = {\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}\quad {\left\{ {r_{pm}^{*}(i)} \right\} \overset{\_}{y_{m}\left( {i - \tau} \right)}}}}} & \left( {0 \leq \tau < L} \right) \\ {{= {{1\quad \tau} = 0}}\quad} & \quad \\ {= {{0\quad \tau} \neq 0.}} & \quad \end{matrix} \right\} & (44) \end{matrix}$

[0154] Namely, y_(m)(i) is a sequence orthogonal to fabricated pilot-frame r_(pm)*(i), except the 0-shift value.

[0155] Then, fabricated pilot-frame r_(pm)*(i) and data analyzing sequence y_(n)(i)(n=0,1,2, . . . M−1) with subscript changed from m to n are applied to a pilot-response generator PGN in the figure, to obtain the 0-shift-correlation value (correlation coefficient) between both of them $\begin{matrix} {p_{n\quad m} = {\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}\quad {{r_{pm}^{*}(i)}\overset{\_}{y_{n}(i)}}}}} & (45) \end{matrix}$

[0156] [where r_(pm)*(i) contains AWGN, so that p_(nm) in the above equation contains the deviation due to noise. Here, the deviation is assumed to be 0]. When assuming p_(nm) is an entry on the n-th column and m-th row, the pilot-response (Decorrelation) matrix P with size M×M is generated. P is parameters defining mutual relation between M kinds of data-frames that may possibly be received from u₀ and analyzing sequences y_(n)(i). This is also an isolated pilot-response which is not affected by disturbance due to the pilot- and data-frames received from the other stations and modulated by different carrier-waves.

[0157] On the other hand, synchronously received data-frame r_(D) ^(0*)(i) which are outputs of the data demodulating circuit D_(D) ⁰ in FIG. 9(b), and data analyzing sequences y_(n)(i), are both applied to correlators C_(or)(y_(n)), generating the 0-shift correlation values Φ_(n) between both of them. If x_(D)(i)=x_(p)(i)=0 is assumed in Eq. (24) and (27), the data decorrelating matrix Φ, which is a set of Φ_(n), can be expressed as follows $\begin{matrix} \left. \begin{matrix} {\Phi = {{\sum\limits_{n = 0}^{M - 1}\quad {\Phi_{n}{\delta \left( {i - n} \right)}}} = \left( {\Phi_{0},\Phi_{1},\quad {\ldots \quad \Phi_{n}},\quad {\ldots \quad \Phi_{M - 1}}} \right)}} \\ {\Phi_{n} = {\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}\quad {{r_{D}^{*}(i)}{\overset{\_}{y_{n}(i)}.}}}}} \end{matrix} \right\} & (46) \end{matrix}$

[0158] From Eq.(28), (45), and (46), Φ_(n) is expressed as follows $\begin{matrix} {\Phi_{n} = {\sum\limits_{n = 0}^{M - 1}{\beta_{n}p_{n\quad m}}}} & (47) \end{matrix}$

[0159] With Eq. (47), a following system of linear equations with M unknowns is obtained [P][β]=[Φ]  (48)

[0160] Taking the deviation due to AWGN contained in r_(p)*(i) and r_(D)*(i) into account as in the case of Eq. (30), and representing the value containing such deviation by the following equation is obtained $\begin{matrix} \begin{matrix} \begin{matrix} {{\left\lbrack P^{\prime} \right\rbrack \left\lbrack \beta^{\prime} \right\rbrack} = \left\lbrack \Phi^{\prime} \right\rbrack} \\ {\begin{pmatrix} \rho_{00}^{\prime} & \rho_{01}^{\prime} & \cdots & \rho_{0m}^{\prime} & \cdots & \rho_{0,{M - 1}}^{\prime} \\ \rho_{10}^{\prime} & \rho_{11}^{\prime} & \cdots & \rho_{1m}^{\prime} & \cdots & \rho_{1,{M - 1}}^{\prime} \\ \vdots & \vdots & \quad & \vdots & \quad & \vdots \\ \rho_{n0}^{\prime} & \rho_{n1}^{\prime} & \cdots & \rho_{n\quad m}^{\prime} & \cdots & \rho_{n,{M - 1}}^{\prime} \\ \vdots & \vdots & \quad & \vdots & \quad & \vdots \\ \rho_{{M - 1},0}^{\prime} & \rho_{{M - 1},1}^{\prime} & \cdots & \rho_{{M - 1},m}^{\prime} & \cdots & \rho_{{M - 1},{M - 1}}^{\prime} \end{pmatrix}\quad} \end{matrix} \\ \left. {\begin{pmatrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \beta_{0}^{\prime} \\ \beta_{1}^{\prime} \end{matrix} \\ \vdots \end{matrix} \\ \beta_{n}^{\prime} \end{matrix} \\ \vdots \end{matrix} \\ \beta_{M - 1}^{\prime} \end{pmatrix}\quad \begin{pmatrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \Phi_{0}^{\prime} \\ \Phi_{1}^{\prime} \end{matrix} \\ \vdots \end{matrix} \\ \Phi_{n}^{\prime} \end{matrix} \\ \vdots \end{matrix} \\ \Phi_{M - 1}^{\prime} \end{pmatrix}} \right\} \end{matrix} & (49) \\ \left. \begin{matrix} \begin{matrix} {p_{n\quad m}^{\prime} = {p_{n\quad m} + {\Delta \quad p_{n\quad m}}}} \\ {\beta_{n}^{\prime} = {\beta_{n} + {\Delta \quad \beta_{n}}}} \end{matrix} \\ {\Phi_{n}^{\prime} = {\Phi_{n} + {\Delta \quad \Phi_{n}}}} \end{matrix} \right\} & (50) \end{matrix}$

[0161] where P′, β′ and (are respectively a pilot-response-matrix with size (M×M) consisting of ρ_(nm)′ as the entry, an unknown matrix consisting of β_(n)′ as the entry, and a data response matrix consisting of Φ_(n)′ as the element. In β-AYZ in FIG. 9(b), by solving the above equations, the unknown variable (the estimated value of the transmitted information) β_(n)′ including an error Δβ_(n) can be obtained. (Hereinafter, the ordinal number in β is changed from n to m.) Considering the assumption of β_(m)=0,±1, β_(m)=0 is viewed as an ineffective output, let us divide M components of outputs {β′} in Eq. (49) into negative and positive groups after making them on the hard decision, and denoting the respective values by β_(m+)′ and β_(m−)′. Using these values, let us obtain the following absolute difference values for the threshold ±1, Δ_(m+) and Δ_(m−). $\begin{matrix} \left. \begin{matrix} {\Delta_{m +} = {{\beta_{m +}^{\prime} - 1}}} \\ {\Delta_{m -} = {{{\beta_{m -}^{\prime} + 1}}.}} \end{matrix} \right\} & (51) \end{matrix}$

[0162] Align Δ_(m+) and Δ_(m−) in the order from small to large and provide a new superscript A and an ordinal number n with each value, so as to be Δ₀ ^(A)<Δ₁ ^(A) . . . <Δ_(γ−1) ^(A). Select γ components from the forehead and make the hard decision whether the corresponding estimated value {β′} takes negative or positive. Then, the detected values of the transmitted information, {{circumflex over (β)}^(s)}=({circumflex over (β)}₀ ^(s), {circumflex over (β)}₁ ^(s), . . . {circumflex over (β)}_(γ−1) ^(s)) can be determined as outputs of β-AYZ. Thus, the detected values of the transmitted information-set, {{circumflex over (b)}}/u₀ can be determined based on {{circumflex over (β)}^(s)}. When the rank of matrix P′ reduces in solving Eq.(49), any one of said solving methods (a) to (c) can be applied.

[0163] According to the above method when a transmit-data-frame consisting of γ components, that is a modulated sequence-set, selected from M kinds of frames is received via multi-transmission-paths, γ binary information {β^(s)} carried by the respective sequences can be detected, by demodulating the received signal to a baseband signal and analyzing it, for example, by obtaining β₀ ^(s)g₀ ^(s)(i) without being disturbed by other multiple sequences β_(m) ^(s)g_(m) ^(s)(i)(m≠0) transmitted simultaneously, and by identifying the above set consisting of γ modulated sequences. In this case, if deviations Δρ_(m), Δd_(m), Δp_(nm), and ΔΦ_(n) contained in Eq.(30) and (50) are large, this processing may be affected by disturbance of other sequences transmitted simultaneously. But such disturbance can be sufficiently alleviated by selecting a set of M kinds of sequences with small cyclic cross-correction-values.

[0164] Note that, when determining the transmitted information estimate value β₀′, for example in Eqs. (29) and (49), the energy of the principal wave and all the delayed waves contained in the received flock-frame carrying this information value are used in the form of a row vector, such as (ρ₀₀, ρ₁₀, ρ₂₀, . . . ρ_(M−1,0)) or (p₀₀, p₁₀, p₂₀, . . . p_(M−1,0)). On the other hand, since a Rake reception method, which has been described as Method (C), uses a received pilot-response containing interference-wave components, it is difficult to use all the energies of delayed waves. However, the method of the present invention uses the isolated pilot-response according to the principle described above, therefore an ideal Rake reception characteristic may be achieved.

[0165] In the above description, z(i) and y_(m)(i) were used as pilot and data analyzing sequences. Any other optional sequences may be used instead of them. For example, the use of g_(m)(i) instead of y_(m)(i) produces the same result if there is no noise.

[0166] Since the analyzing method using y_(m)(i) has such a characteristic as to provide high sensitivity in detecting r_(pm)*(i) component contained in r_(D) ^(0*)(i), it results in enhancing the regularity of the pilot-response-matrix P and making solution β′ less sensitive to of noise ΔP_(nm) and ΔΦ_(n).

[0167] The method described above uses a set of M kinds of different sequences. By extending this method so that the respective τ(=0,1,2 . . . . L−1) shift sequences may be added to M′ kinds of basic sequence g_(m)(i), the number of sequences increases to LM′. According to this idea, consider a cyclically shifted multiple sequence method, with which γ sequences of LM′ kinds of sequences are selected for transmission. When applying the above method to the direct analysis method using FIG. 2, the system is equivalent to that defined by elements composing the transmit-sequences in the previous description. By setting as

M=M′L,  (52)

[0168] the solution can be obtained using Eq. (29).

[0169] On the other hand, when applying this sequence set to the correlation analysis method, it is required to use matched filters MF[y_(n)(i)](n=0,1,2, . . . M′−1) as the correlators in FIG. 9(b). The total number of these outputs is M=M′L. Therefore, this can be applied to the system of linear equations in Eq. (49). Namely, the synchronously received data-frame r_(D) ^(0*)(i) is applied to M matched filters. The n-th matched filter MF[y_(n)(i)] generates the n-th correlation output Φ_(nτ) shown in the following equation with shift values τ(=0,1,2, . . . L−1). $\begin{matrix} {\Phi_{n\quad \tau} = {\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}\quad {{r_{D}^{0^{*}}(i)}\overset{\_}{y_{n}\left( {i - \tau} \right)}}}}} & (53) \end{matrix}$

[0170] On the other hand, the fabricated pilot-frames of this method is given by r_(pm)*(i−τ) which are the cyclically shifted sequences of r_(pm)*(i). The τ shift correlation with analyzing sequence y_(n)(i) is given by the following equation $\begin{matrix} \begin{matrix} {p_{m\quad \tau \quad n\quad \tau^{\prime}} = {\frac{1}{L}{\sum\limits_{i = 0}^{L - 1}{{r_{pm}^{*}\left( {i - \tau} \right)} \cdot \overset{\_}{y_{n}\left( {i - \tau^{\prime}} \right)}}}}} & \quad & \left( {m,{n = 0},1,2,{{\ldots \quad M^{\prime}} - 1}} \right) \\ \quad & \quad & \left( {\tau,{\tau^{\prime} = 0},1,2,{{\ldots \quad L} - 1}} \right) \end{matrix} & (54) \end{matrix}$

[0171] Using P_(mτnτ′) and Φ_(nτ), a system of linear equations with size M×M may be obtained as, similarly to the case in Eq. (49)

[P′][β′]=[Φ′].  (55)

[0172] Solving the above equation to obtain γ components of {{circumflex over (β)}^(s)}, a transmitted information-set {{circumflex over (b)}}/u₀ is detected.

[0173] Therefore, this method achieves large-capacity transmission using the minimum number M′ of the basic spreading sequences. When using self-orthogonal sequences (such that the auto-correlation takes 0 at the shift positions less than 0-shift. Two-phase sequences with length L=4, four-phase sequences with length L=16, etc are well known) as g_(m)(i), it is easy to solve the system of linear equations in Eq. (55).

[0174] With M′=1 is assumed for the above sequence population, the M kinds of spreading sequences can be made, for example, with only cyclically shifted sequences of g₀(i). This is a cyclically shifted single sequence method, and if auto-orthogonal sequences is to be used as g₀(i), an excellent error rate characteristic may be obtained.

[0175] Now, consider another example of using M kinds of spreading sequences. Let us produce a product of each column (Walsh function) of Hadamarl matrix with size N×N and a partial sequence M_(s)(s=0,1,2, . . . S−1) with sequence length L, for example, which has been extracted from a long M-sequence. Assuming the product to be a spreading sequence g_(ns)(i), a set of NS spreading sequences {g_(ns)(i)} can be obtained. As sequences g_(n′s)(i) and g_(ns)(i)(n′≠n) are orthogonal each other, this method can generate a sequence set characterized by a large population, small cross correlation, and short sequence length. The present invention can use such sets as stated above.

[0176] [Data Channel Sharing Method]

[0177] As the third embodiment-example, let us explain a data-channel sharing method, in which data-frames of all users are transmitted using a common carrier-wave f_(D). The transmitter and receiver can be expressed by using the block diagram in FIGS. 2 and 4 whose symbols are to be changed. This example is characterized in that the baseband-transmission-data-frames of all the users, e_(D)(i)/u_(k), (k=0,1,2, . . . K−1) can be transmitted with a common data carrier-wave f_(D). [In the first and second embodiment-examples, mutually different data-carrier-waves (f_(k)) for respective users are used.] Assume here that the transmitter of the k-th user u_(k) uses M′ kinds of spreading sequences g_(m) ^(k)(i)(k=0,1,2, . . . M′−1). In this case, the system requires

M=KM′  (56)

[0178] kinds of sequences.

[0179] The transmitter according to the present invention is designed by replacing the k-th data carrier-waves f_(k) in FIG. 2 with the common carrier-wave f_(D), while keeping the pilot carrier-wave f_(k)′ as it is.

[0180]FIG. 10 shows a block diagram of a multi-user-receiver RX in which the direct analysis method is applied to this embodiment-example. Among the functions in this system in FIG. 4, the pilot demodulating circuit D_(p) ⁰ for u₀ is expanded to pilot demodulating circuits for all the users, D_(p) ⁰,D_(p) ¹ . . . D_(p) ^(K−1). Based on the response of the k-th user, {u^(k)}, a set of M′ kinds of fabricated pilot-frames {r_(pm) ^(k*)} to be used by the k-th user, is generated. Similarly to the case in Eq. (27), r_(pm) ^(k*)(i) is given by $\begin{matrix} \left. \begin{matrix} {{r_{pm}^{k^{*}}(i)} = {{\sum\limits_{j = 0}^{J - 1}{\mu_{j}{g_{m}^{k}\left( {i - j} \right)}}} + {x(i)}}} \\ {\quad {{= \left( {\rho_{m\quad 0}^{k^{\prime}},\rho_{m\quad 1}^{k^{\prime}},{\ldots \quad \rho_{m,{L - 1}}^{k^{\prime}}}} \right)},}} \end{matrix} \right\} & (57) \end{matrix}$

[0181] thus producing M′ frames in total.

[0182] The above response {^(k)} is applied to synchronous circuit SYN in which the frame pulse e_(F) to designate the synchronously received frame-period is produced. e_(F) is set so that the boundary of enveloped frames incoming from all the users may not be included in this period. Similarly to the case in FIG. 4, the illustrated data-signal demodulating circuit D_(D) produces the following synchronously received data-frame with frame pulse e_(F) $\begin{matrix} {{r_{D}^{*}(i)} = {{{\sum\limits_{k = o}^{K - 1}{\sum\limits_{m = 0}^{M - 1}{\sum\limits_{j = 0}^{J}{{\hat{\mu}}_{j}^{k}\beta_{m}^{k}{g_{m}^{k}\left( {i - j} \right)}}}}} + {x_{D}(i)}} = {\left( {d_{0}^{\prime},d_{1}^{\prime},{\ldots \quad d_{L - 1}^{\prime}}} \right).}}} & (58) \end{matrix}$

[0183] r_(D)*(i) is applied, together with M=KM′ fabricated pilot-frames, to the analyzing circuit β-AYZ. Generating a pilot-matrix ρ′ using the fabricated pilot-frames, each is made by transposing the user related components (attached by superscript k) of {ρ_(mi)′} in Eq. (27), the following equation is obtained. The analysis is performed by solving the equation. $\begin{matrix} {{\left\lbrack \rho^{\prime} \right\rbrack \left\lbrack \beta^{k^{\prime}} \right\rbrack} = \left\lbrack d^{\prime} \right\rbrack} & \quad \\ \left. {{\begin{pmatrix} \rho_{00}^{0^{\prime}} & \rho_{01}^{0^{\prime}} & \cdots & \rho_{0,{M^{\prime} - 1}}^{0^{\prime}} & \rho_{00}^{1^{\prime}} & \rho_{01}^{1^{\prime}} & \cdots & \rho_{0,{M^{\prime} - 1}}^{1^{\prime}} & \cdots & \rho_{00}^{K - 1^{\prime}} & \rho_{01}^{K - 1^{\prime}} & \cdots & \rho_{0,{M^{\prime} - 1}}^{K - 1^{\prime}} \\ \rho_{10}^{0^{\prime}} & \rho_{11}^{0^{\prime}} & \cdots & \rho_{1,{M^{\prime} - 1}}^{0^{\prime}} & \rho_{10}^{1^{\prime}} & \rho_{11}^{1^{\prime}} & \cdots & \rho_{1,{M^{\prime} - 1}}^{1^{\prime}} & \cdots & \rho_{10}^{K - 1^{\prime}} & \rho_{11}^{K - 1^{\prime}} & \cdots & \rho_{1,{M^{\prime} - 1}}^{K - 1^{\prime}} \\ \vdots & \vdots & \quad & \vdots & \vdots & \vdots & \quad & \vdots & \quad & \vdots & \vdots & \quad & \vdots \\ \rho_{{L - 1},0}^{0^{\prime}} & \rho_{{L - 1},1}^{0^{\prime}} & \cdots & \rho_{{L - 1},{M^{\prime} - 1}}^{0\prime} & \rho_{{L - 1},0}^{1^{\prime}} & \rho_{{L - 1},1}^{1^{\prime}} & \cdots & \rho_{{L - 1},{M^{\prime} - 1}}^{1^{\prime}} & \cdots & \rho_{{L - 1},{M^{\prime} - 1}}^{1^{\prime}} & \rho_{{L - 1},1}^{K - 1^{\prime}} & \cdots & \rho_{{L - 1},{M^{\prime} - 1}}^{K - 1^{\prime}} \end{pmatrix} \times \begin{pmatrix} \beta_{0}^{0^{\prime}} \\ \beta_{1}^{0^{\prime}} \\ \vdots \\ \beta_{M^{\prime} - 1}^{0^{\prime}} \\ \beta_{0}^{1^{\prime}} \\ \beta_{1}^{1^{\prime}} \\ \vdots \\ \beta_{M^{\prime} - 1}^{1^{\prime}} \\ \vdots \\ \vdots \\ \beta_{M^{\prime} - 1}^{K - 1^{\prime}} \end{pmatrix}} = \begin{pmatrix} d_{0}^{\prime} \\ d_{1}^{\prime} \\ \vdots \\ \vdots \\ \vdots \\ \vdots \\ \vdots \\ \vdots \\ \vdots \\ \vdots \\ d_{L - 1}^{\prime} \end{pmatrix}} \right\} & \text{(59)} \end{matrix}$

[0184] The size of matrix ρ′ in the above Eq. is (L×M). When M=KM′=L, the solution is normally obtained. For M<L, the previously stated method to obtain the maximum likelihood solution, (a), (b), and (c), can be applied. In this case, the parameters used in the previous method are to be converted so as to be (M→KM′, γ→Kγ).

[0185] Thus, in the unknown set {β^(k′)}, γ (γ=2 in the figure) information-components each user transmitted are contained. By solving the above Eq., Kγ information-components in total can be obtained. Namely, the embodiment in FIG. 10 has a multi-user-receiver function. Since it is required for this method to establish mutually orthogonal relationship among K pilot carrier-waves f_(k)′ and data common carrier-wave f_(D) As a consequence, for example, it is necessary to give the following relation by referring to Eq.(18) $\begin{matrix} {{f_{D} = f_{00}}{f_{k}^{\prime} = {f_{00} + {\left( {k + 1} \right)f_{G}}}}} & (60) \end{matrix}$

[0186] Based on Kγ transmitted information thus obtained, the transmitted information-set {{circumflex over (b)}}/u_(k) of the user u_(k) with circuit p−s shown in the figure can be obtained.

[0187] Note that the correlation analysis method may also be applied to the third embodiment-example. In this case, the correlation-outputs p_(nm)* and Φ_(n)* between each of r_(pm) ^(k*)(i) and r_(D) ^(k*)(i), and data analyzing sequence y_(n) ^(k)(i) are obtained, respectively, and a system of linear Eq.s similar to Eq.(49) is solved, to determine unknown set {β^(k′)}.

[0188] In this embodiment-example, if setting M′=1, a single-ary system is realized, in which each user uses a single spreading sequence g_(k)(i) and is supported by the isolated pilot. The above methods can be also applied to the receive-demodulation of this system.

[0189] [Complex Number Developed Sequence Extending Method]

[0190] As the channel-response {u^(k)} generally takes complex numbers in the above-described system, fabricated pilot-frame r_(pm)*(i) takes complex numbers even when transmit basic sequence g_(m)(i) is a binary phase or real-number sequence. As a result, it has been described that all of data-frames r_(D)*(i), pilot-response p_(nm)′, and data-response Φ_(n)′ take complex numbers. In solving Eq.(29), a condition M L is required mathematically, regardless of whether the constituent elements of the equation are real numbers or complex numbers. By noticing here that M is restricted by the length L of basic spreading sequences, the fourth embodiment-example method in which this sequence length L is artificially increased at a receiver is described.

[0191] This method is to develop a synchronously received frame with L chips taking complex numbers, and convert it into a frame with 2L chips taking real numbers. Each chip amplitude of fabricated pilot-frame r_(pm)* and received data-frame r_(D)*(i) in Eq. (27) and (24), respectively, is represented by complex numbers in the following equation $\begin{matrix} \left. \begin{matrix} \begin{matrix} {{r_{pm}^{*}(i)} = \left( {{\rho_{m\quad 0R}^{\prime} + {j\quad \rho_{m\quad 0J}^{\prime}}},{\rho_{m\quad 1R}^{\prime} + {j\quad \rho_{m\quad 1J}^{\prime}}},{{\ldots \quad \rho_{m,{L - 1},R}^{\prime}} + {j\quad \rho_{m,{L - 1},J}^{\prime}}}} \right)} \\ \left( {{M = 0},1,2,{{\ldots \quad M} - 1}} \right) \end{matrix} \\ {{r_{D}^{*}(i)} = \left( {{d_{0R}^{\prime} + {j\quad d_{0J}^{\prime}}},{d_{1R}^{\prime} + {j\quad d_{1J}^{\prime}}},{{\ldots \quad d_{{L - 1},R}^{\prime}} + {j\quad d_{{L - 1},J}^{\prime}}}} \right)} \end{matrix} \right\} & (61) \end{matrix}$

[0192] where j={square root}{square root over (−1)}, and the chip amplitude in Eq. (25) is represented with the real part having subscript R and the imaginary part having the subscript J, such as ρ_(m0)′=ρ_(m0R)′+jρ_(m0J). By regarding the imaginary part of the above Eq. as another real part, a frame excluding the sum symbol + and imaginary symbol j is made as follows $\begin{matrix} \begin{matrix} \begin{matrix} {{r_{pmE}^{*}(i)} = \left( {\rho_{m\quad 0R}^{\prime},\rho_{m\quad 1R}^{\prime},{\ldots \quad \rho_{m,{L - 1},R}^{\prime}},\rho_{m\quad 0J}^{\prime},{\rho_{m\quad 1J}^{\prime}\quad \ldots \quad \rho_{m,{L - 1},J}}} \right)} \\ \left( {{m = 0},1,2,{{\ldots \quad M} - 1}} \right) \end{matrix} \\ {{r_{DE}^{*}(i)} = \left( {d_{0R}^{\prime},d_{1R}^{\prime},{\ldots \quad d_{{L - 1},R}^{\prime}},d_{0J}^{\prime},d_{1J}^{\prime},{\ldots \quad d_{{L - 1},J}^{\prime}}} \right)} \end{matrix} & (62) \end{matrix}$

[0193] where the element alignment order can be arbitrary selected. (However, the same alignment order must be used for pilot and data-frames.) Thus, the double length frame consisting of 2L chips can be produced. The important matter is that all of the above double length frames can be regarded to be of made from random sequences because the real part and the imaginary part of channel-response {u^(k)} are mutually independent random variables. [For a transmission-path without multi-path, independence of the above real and imaginary parts is lost. To cope with such situation, it is enough to use a four-phase sequence consisting of random sequences with real and imaginary parts being mutually independent, as the transmission basic sequence g_(m)(i).]

[0194] In applying the principle of this sequence extending method to the first embodiment-example, the parameter changes L→2L in Eq.(29). In consequence, when Eq. (29) is to be solved according to a general solution method, a condition M≦L is required in the above description. However, this restriction may be alleviated as follows by using the above double length frame

M≦2L.  (63)

[0195] If the previous solutions (a), (b), and (c) are to be applied to a case of M>2L, the use of double length frame can improve considerably the error rate characteristics caused by noise. For cases where this principle is applied to the second and fourth embodiment-examples, respectively, it becomes easy to increase M and KM′ as the analyzing dimension increases.

[0196] When this is applied to the first embodiment-example, a conversion from r_(D)*(i) in Eq.(61) to r_(DE)*(i) in Eq.(62) is performed at sequence extender SQEX_(D) shown in the dotted line frame in FIG. 4. The similar function for fabricated pilot-frames is performed with sequence extender SQEX_(p) prepared in FFG, resultantly r_(pmE)*(i) shown in the figure is outputted. In this case, r_(DE)* and {r_(pmE)*} are used instead of r_(D)* and {r_(pm)*} shown in the figure, as the inputs to analyzer β-AYZ. In cases where applied to the second and third embodiment-examples, outputs r_(pmE)*, r_(DE)*; r_(pmE) ^(k*), r_(DE)* of sequence extenders SQEX_(p) and SQEX_(D) shown by the dotted line frames in FIGS. 9 and 10 may be used for previously described analysis.

[0197] [Diversity Received Type Sequence Extending Method]

[0198]FIG. 11 shows the fourth embodiment-example which is a circuit composition of a transceiver in which a sequence extending method using diversity-antennae is applied to the first embodiment-example. Fig. (a) shows a circuit composition of a transmitter of the k-th user u_(k). The output of the transmitter circuit TX_(k) in FIG. 2 is transmitted to two (generally, one or plural pieces) diversity-antennas A_(T0) and A_(T1).

[0199] Fig. (b) shows a receiver to detect the signal of the 0-th user u₀, as a desired station. The receiver is provided with N_(d)(≧2) pieces of receive-diversity-antennae A_(Rd)(d=0,1, . . . Nd−1). D_(pd) ⁰, D_(Dd) ⁰ and FFG_(d)(d=001) in the figure are respectively the pilot demodulating circuit D_(p) ⁰, data demodulating circuit D_(D) ⁰, and fabricated frame generator FFG which were used as the circuits of receiver in FIG. 4, and two systems of the circuits are prepared in correspondence to N_(d)=2. A_(R0) and A_(R1) are installed generally apart by half a wavelength of the carrier-wave, based on the space diversity reception principle. If a polarization diversity is to be used (or the polarization diversity is to be used in parallel), it is physically possible to obtain two outputs with one antenna. (In this case, it is necessary to use transmit-polarization-diversity-antennae, or to use transmit-polarization-diversity-antennae in parallel.)

[0200] Pilot demodulating circuit D_(pd) ⁰ outputs channel-response {μ⁰}_(d), and fabricated frame generator FFG_(d) produces a set of fabricated (synchronously-received) pilot-frames {r_(pm)*}_(d) using both the outputs and basic spreading sequence set {g_(m)} not illustrated. These outputs are applied to the sequence extender SQEX_(p). When m is assumed to be fixed, N_(d)L chip elements are applied to SQEX_(p), because each frame of {r_(pm)*}_(d) consists of L chip elements. These elements are arranged in a predetermined order on the time axis. An extended fabricated pilot r_(pmE)* consisting of N_(d)L chip elements, arranged as described above is produced. Since there are M kinds of extended fabricated pilots, M sets {r_(pmE)*} are fabricated.

[0201] On the other hand, a synchronously received data-frame r_(pd) ^(0*), which is a baseband output of data demodulating circuit D_(pd) ^(o), is applied to sequence extender SQEX_(D). Here, similarly to the case previously described, all the elements (N_(d)L chips) of the respective frames, each of which consists of L chip elements, are arranged on the time axis, generating an extended synchronously received data-frame r_(DE) ^(0*) consisting of N_(d)L chips is produced.

[0202] Similarly to Eq.(61), the inputs to sequence extenders SQEX_(p) and SQEX_(D) may be expressed as follows $\begin{matrix} {{{r_{pm}^{*}(i)}_{d} = \left( {\rho_{{m\quad 0} - d}^{\prime},\rho_{{m\quad 1} - d}^{\prime},{\ldots \quad \rho_{m,{L - 1},{- d}}^{\prime}}} \right)}{{r_{D}^{0^{*}}(i)}_{d} = \left( {d_{0 - d}^{\prime},d_{1 - d}^{\prime},{\ldots \quad \rho_{{L - 1},{- d}}^{\prime}}} \right)}} & (64) \end{matrix}$

[0203] where ρ_(mi−d)′ and d_(i−d)′ are the i-th complex chip amplitudes including AWGN. For example, taking a method in which the inputs in Eq.(64) are sequentially aligned with regard to d in cascade, the outputs of SQEX_(p) and SQEX_(D) are given by the following Eq. for a fixed value m. $\begin{matrix} {{{r_{pmE}^{*}(i)} = \left\lfloor {{r_{pm}^{*}(i)}_{0},{r_{pm}^{*}(i)}_{1},{\ldots \quad {r_{pm}^{*}(i)}_{{Nd} - 1}}} \right\rfloor}{{r_{DE}^{0^{*}}(i)} = \left\lbrack {{r_{D}^{*}(i)}_{0},{r_{D}^{*}(i)}_{1},{\ldots \quad {r_{D}^{*}(i)}_{{Nd} - 1}}} \right\rbrack}} & (65) \end{matrix}$

[0204] For simplicity, using Eq. (64), the constituent elements of the above Eq. may be expressed as follows, for N_(d)=2 $\begin{matrix} \left. \begin{matrix} {{r_{pmE}^{*}(i)} = \left( {\rho_{m\quad 0E}^{\prime},\rho_{m\quad 1E}^{\prime},{\ldots \quad \rho_{m,{{2L} - 1},E}^{\prime}}} \right)} \\ \begin{matrix} {\rho_{miE}^{\prime} = \rho_{{mi} - 0}^{\prime}} & \left( {0 \leq i \leq {L - 1}} \right) \\ {\quad {= \rho_{m,{({i - L})},{- 1}}}} & \left( {L \leq i \leq {{2L} - 1}} \right) \end{matrix} \end{matrix} \right\} & (66) \\ \left. \begin{matrix} {{r_{DE}^{0^{*}}(i)} = \left( {d_{0E}^{\prime},d_{1E}^{\prime},{\ldots \quad d_{{{2L} - 1},E}^{\prime}}} \right)} \\ \begin{matrix} {d_{iE}^{\prime} = d_{i - 0}^{\prime}} & \left( {0 \leq i \leq {L - 1}} \right) \\ {\quad {= d_{{({i - L})},{- 1}}^{\prime}}} & {\left( {L \leq i \leq {{2L} - 1}} \right).} \end{matrix} \end{matrix} \right\} & (67) \end{matrix}$

[0205] From a set {r_(pmE)*} of the above extended fabricated pilots, pilot matrix ρ′ with size M×N_(d)L is produced. On the other hand, unknown matrix β′ and the extended synchronously received data-matrix d′, consisting of M and N_(d)L elements, respectively, are produced. Using these matrices, a system of linear Eq.s similar to Eq.(29) is produced. Therefore, the number of dimensions available to obtain the solution with a general method increases to M≦N_(d)L.

[0206] In the previous description using the circuit composition in FIG. 11, the m-th basic spreading sequence g_(m)(i) used by transmitter TX to transmit the m-th transmit information β_(m) was assumed to be one kind. Now, assume that N_(v) kinds of sequences are prepared in correspondence to N_(v) transmit antennas. Namely, a sequence set {g_(m)}=(g_(m0), g_(m1), . . . g_(mv), . . . g_(m,Nv−1)) is prepared. For simplicity, γ=1 is assumed here. Since β_(m)g_(mv) becomes the basic data-frame s_(Dv)(i) in FIG. 5, N_(v) frames are similarly produced.

[0207] On the other hand, preparing a sequence set {g_(p)}=(g_(p0), g_(p1), . . . g_(p,Nv−1)) for pilots, N_(v) basic pilot-frames pg_(pv) similarly to the description stated above are produced. Sequences made by synthesizing the above data-frames and pilot-frames, respectively, are denoted by s_(Dv)(i) and s_(pv)(i) in FIG. 5. By repeating each of them N times, the respective core-sequences are produced, to which the guard sequences are aded to produce the baseband enveloped transmit-frames e_(Dv(i)[=e) _(Dmv)(i)] and e_(pv)(i). Convolutionally modulating the chip-waveform and then modulating the orthogonal carrier-wave with these frames produce the v-th transmit-frame s_(av)(t). This is transmitted via the v-th transmitting diversity-antenna A_(Tv).

[0208] At the receiver, pilot demodulating circuit D_(pd) ⁰ is replaced with D_(pvd) ⁰, while data demodulating circuit D_(Dd) ⁰ is replaced with D_(Dvd) ⁰ in FIG. 11(b), because the number of inverse spreading sequences increases from one to N_(v), so that N_(v)-fold of both the demodulating circuits are required. As the outputs of the pilot demodulating circuits, N_(v)N_(d) channel-responses {μ⁰}_(vd)(v=0,1, . . . N_(v)−1, d=0,1, . . . N_(d)−1) are produced. Similarly, N_(v)N_(d) synchronously received data-frames r_(Dvd)* are also produced. Based on the above pilot-response and basic spreading sequences, the fabricated pilot-frame r_(pmvd)* with sequence length L is fabricated. Sequence extender SQEX_(p) aligns these frames, generating a set of extended fabricated pilot-frames {r_(pmE)*} with sequence length N_(v)N_(d)L. (This sequence length may reduce less than N_(v)N_(d)L by eliminating a part of small-power frames or through addition on the time axis.) Similarly, based on synchronously received data-frame r_(Dvd)*, and using the same alignment method, extended synchronously received data-frame r_(DE)* with the same sequence length may be produced. Thus, the number of dimensions of a system of linear Eq.s can be increased to N_(v)N_(d)L.

[0209] Note that the complex number developed sequence extending functions described with Eq. (62) may be included in the functions of sequence extenders SQEX_(p) and SQEX_(D) described above. Since the number of dimensions of the above matrices increases to 2N_(v)N_(d)L, a condition such as to solve the equations easily can be alleviated as follows

M≦2N_(v)N_(d)L  (68)

[0210] Note also that the principle of the diversity reception method described with FIG. 11 can be applied to the second and third embodiment-examples. Namely, in FIG. 10, N_(d) receive antennas are provided. The output from one antenna is applied to a receiving block consisting of K pilot blocks D_(p) ^(k)-FFG and one data demodulating circuit D_(D). The outputs from all the antennas are applied to similar N_(d) receiving blocks whose outputs are applied to SQEX_(p) and SQEX_(D), respectively, similar to sequence extenders SQEX_(p) and SQEX_(D), in FIG. 11, to produce M extended fabricated pilot-frames and one extended synchronously received data-frame. With this method, a multi-user receiver having dimensions increased with aid of the extended sequences can be realized. On the other hand, if N_(d) receiving blocks each consisting of D_(p) ⁰ and D_(D) ⁰ similarly are provided in FIG. 9, a receiver such as to use the extended sequences and the correlation analysis method can be realized.

[0211] The transmit-diversity-principle may be applied to the above cases. Namely, by increasing the number of transmit-antennas and extended sequences by N_(v) fold, the number of dimensions of the equations can be further increased.

[0212] [Analyzing Matrix Regularization Method]

[0213] Regularity of pilot-response-matrix P′ in Eq.(49) degrades generally when kind M of the basic spreading sequences are excessively large and a condition of M≧L for the sequence length L exists. To avoid this problem, known matrix regularization technology using dummy pilot-response [M. Tomita, et al, “An interference analyzing system for CDMA signals utilizing lone pilot-responses and an additional dummy pilot-response”, Technical resport of the Institute of Electronics, Information and Communication Engineers, SST2000-43] may be employed. This known method is technology in which the kinds of symbol frames (number of information) that can be transmitted on an identical symbol-frame-time-width T_(E) is reduced to (L−1) for the spreading sequence length L. In this case, the remaining one is used to send dummy-information which is not actual transmit-information. Namely, there exists a problem that, despite it has a capability of transmitting L pieces of information, only (L−1) pieces of information can be transmitted to enhance the regularity.

[0214] In this invention, the above technology is developed further where a method of using additional vectors along with the Dummy-information and the Dummy Spreading Sequence is explained. Namely, h (generally h≧1) fabricated synchronously received frames which are not actually transmitted, are added for the analysis in a receiver. For this purpose, the receiver increases the size of the sequence population, for example, by adding h dummy spreading sequences, to (M+h), where actually M kinds of sequences are used. In other words, pilot-response-matrix P′ in Eq.(49) is modified to expanded matrix P₊′ with size (M+h)×(M+h). Assume here that h=1 and the dummy spreading sequence is g_(M)(i). A case in which let the right-most pilot-response corresponding to a fabricated pilot-frame r_(pM)*(i), not contained in the actual synchronously received frame r_(D)*(i), be an additional column vector (P₀₁, P_(1M), . . . P_(nM), . . . P_(M,M))^(T)=(a₀, a₁, . . . a_(n) . . . a_(M))^(T) is described.

[0215] The receiver produces fabricated pilot-frame r_(pm)*(i) from both dummy spreading sequence g_(M) and channel-response {μ⁰} between desired station u₀ and base station BS, using Eq. (27). Based on this frame, an additional row vector P_(M)′=(P_(M0)′, P_(M1)′, . . . P_(Mn)′ . . . P_(M,M−1)′) using Eq.(45) is produced. Column vector A does not contain a noise component while row vector P_(M)′ contains a noise component because it is affected by the noise of {μ⁰}. Column vector A is selected by the receiver so that the regularity of the extended pilot-response-matrix P₊′ may be enhanced. In addition, the M-th information is set to be a dummy-information β_(M) ^(D)=(β_(γ) ^(S))=1 and, the n-th correcting term a_(n) corresponding to vector A are added to the n-th element Φ_(n)′, of the data response matrix on the right side of Eq. (49).

[0216] Assuming that the corrected value is Φ_(n)″

Φ_(n)″=Φ_(n) ′+a _(n)(n=0,1,2, . . . M)  (69)

[0217] where Φ_(M)′ is given by Eq. (46) and γ_(M)(i) obtained from Eq. (44). (a_(n)=0 may be set in the above equation, with β_(M) ^(D)=0.)

[0218] From these equations, the following equation in which the size of Eq. (49) is enlarged is obtained. $\begin{matrix} \left. \begin{matrix} {{\left\lbrack P_{+}^{\prime} \right\rbrack \left\lbrack \beta_{+}^{\prime} \right\rbrack} = \left\lbrack \Phi_{+}^{''} \right\rbrack} \\ {{\begin{pmatrix} \quad & \quad & \quad & \quad & a_{0} \\ \quad & \left( P^{\prime} \right) & \quad & \quad & a_{1} \\ \quad & \quad & \quad & \quad & \vdots \\ \quad & \quad & \quad & \quad & a_{M - 1} \\ P_{M,0}^{\prime} & P_{M1}^{\prime} & \cdots & P_{M,{M - 1}}^{\prime} & a_{M} \end{pmatrix}\begin{pmatrix} \beta_{0}^{\prime} \\ \beta_{1}^{\prime} \\ \vdots \\ \beta_{M - 1}^{\prime} \\ \beta_{M}^{D} \end{pmatrix}} = {\begin{pmatrix} \Phi_{0}^{\prime} \\ \Phi_{1}^{\prime} \\ \vdots \\ \Phi_{M - 1}^{\prime} \\ \Phi_{M}^{\prime} \end{pmatrix} + \begin{pmatrix} a_{0} \\ a_{1} \\ \vdots \\ a_{M - 1} \\ a_{M} \end{pmatrix}}} \end{matrix} \right\} & (70) \end{matrix}$

[0219] The above Eq. is a system of linear Eq.s in which the additional column vector A and additional row vector PM are added. In this case, P₊′, β₊″ and Φ₊″ are the enlarged pilot-response-matrix, the enlarged unknown matrix, and the corrected data response matrix, respectively, and A is selected by the receiver. Specifically, with |a_(n)|=1, select the polarity (or complex number value) of a_(n) so that the value (determinant) of matrix P₊′ or the singular value may be increased.

[0220] For a case where the rank of P′ reduces by more than two, the processing may be made by increasing the number of dummy sequences h to more than two. In this way, the best characteristics may be provided to P₊′. Consequently, with this method not much affected by the effect of additive white Gaussian noise,

[0221] highly reliable transmitted information estimate {β′} can be obtained.

[0222] Note that Eq. (49) can be solved in most cases under a condition of M≦L. If not, the regularity of these Eq.s can be improved by preparing the means of selecting the above additional column vectors A so that the absolute values of determinants D[P₊′] of pilot-response-matrices P′ and P₊′ [or the normalized singular values (ratios the minimum to the maximum singular values)] may increase.

[0223] Eq. (49) can be solved using a known method in which the elements of the equations contained in Eq. (49) are separated into real and imaginary parts to convert them to equations with doubled sized matrix. However, by producing fabricated pilot-frame r_(pm)*(i), synchronously received data-frame r_(D)*(i), and analyzing sequence y_(m)(i) each of which is a real value frame with double length of 2L chips, and using the previously described complex number developed sequence extending method, Eq. (49) can be solved inmost cases under a condition of M≦2L. If not, the above-described additional column vector A may be added to solved it. Therefore, it is more advantageous to use the additional vector method together with the sequence extending method.

[0224] With h>1, the effect of enhancing the regularity of matrix P′ increases. This additional vector method can be applied to solve Eq. (55), etc. With the direct analysis method, column vector P_(M)′ in Eq. (70) cannot be obtained. When a system of linear

[0225] equations with M unknowns is to be solved by setting L=M in Eq. (29), it can be solved by developing further the technology of using the unknown dummy number, the dummy spreading sequence, and the additional row vector stated above, even if the rank of pilot matrix ρ′ were to reduce.

[0226] By adding an additional column vector A similarly to the case in Eq. (70), and by introducing further an additional row vector C=(c₀, c₁, . . . c_(M−1)) and a dummy-information β_(M) ^(D), Eq. (29) is converted to a system of linear equations with (M+1) unknowns as follows $\begin{matrix} \left. \begin{matrix} {{\left\lbrack \rho_{+}^{\prime} \right\rbrack \left\lbrack \beta_{+}^{\prime} \right\rbrack} = \left\lbrack d_{+}^{\prime} \right\rbrack} \\ {{\begin{pmatrix} \quad & \quad & \quad & \quad & \quad & a_{0} \\ \quad & \quad & \left( \rho^{\prime} \right) & \quad & \quad & a_{1} \\ \quad & \quad & \quad & \quad & \quad & \vdots \\ \quad & \quad & \quad & \quad & \quad & a_{M - 1} \\ c_{0} & c_{1} & c_{2} & \cdots & c_{M - 1} & a_{M} \end{pmatrix}\begin{pmatrix} \beta_{0}^{\prime} \\ \beta_{1}^{\prime} \\ \vdots \\ \beta_{M - 1}^{\prime} \\ \beta_{M}^{D} \end{pmatrix}} = {\begin{pmatrix} d_{0}^{\prime} \\ d_{1}^{\prime} \\ \vdots \\ d_{M - 1}^{\prime} \\ d_{M} \end{pmatrix} + \begin{pmatrix} {\Delta \quad d_{0}} \\ {\Delta \quad d_{1}} \\ \vdots \\ {\Delta \quad d_{M - 1}} \\ {\Delta \quad d_{M}} \end{pmatrix}}} \end{matrix} \right\} & (71) \end{matrix}$

[0227] where ρ₊′, β₊′ and d₊′ are respectively the enlarged pilot matrix, enlarged unknown matrix, and compensated data-matrix. Note that d_(M) is an additional constant while Δd_(m)(m=0,1,2, . . . M−1) is the compensating term defined by column vector A and β_(M) ^(D) as (Δd_(m)=α_(m)β_(M) ^(D)).

[0228] For simplicity, let us assume |α_(n) |=|c _(m)|=1 (n,m=0,1,2, . . . M−1).  (72)

[0229] Besides, the following relationship is established, because of restriction of transmitted information $\begin{matrix} {{\sum\limits_{m = 0}^{M - 1}{\beta_{m}}} = {\gamma \quad {\left( {{\beta_{m} \in {\pm 1}},0} \right).}}} & (73) \end{matrix}$

[0230] Virtual data element d_(M) is given by the following equation $\begin{matrix} {d_{M} = {{\sum\limits_{m = 0}^{M - 1}{c_{m}\beta_{m}^{\prime}}} + {a_{M}{\beta_{m}^{D}.}}}} & (74) \end{matrix}$

[0231] If β_(M) ^(D)=0 is assumed for simplicity, the second term in the above equation and Δd_(m)(m=0,1,2, . . . M−1) in Eq.(71) take 0. Considering c_(m)(ε±=1) and β_(m)(ε±1,0), there exists a row vector C so that d_(M)=0 holds good for γ of even number and d_(M)=1 (or −1) holds good for γ of odd number.

[0232] Assume, for example, to set γ=2, β₀=β₁=1 and c_(o)=−c₁=1, and to provide an optional values to c_(m)(m≠0,1), then d_(M)=0 may be obtained. There exists at least one row vector C that gives d_(M)=0 for each combination of β₊′. Therefore, by preparing in advance multiple row vector sets C_(l)(l=0,1,2, . . . N−1), d_(M)=0 for respective unknown sets can be found, using one of vectors in sets C_(l).

[0233] In Eq. (73), by assuming γ=2 and setting d_(M)=0, and every time of providing one of N_(C)′ kinds of row vectors C_(l) sequentially, let us set column vectors A_(l) for original pilot matrix ρ′ and C_(l) so that the regularity of ρ₊′ may be enhanced. Using matrix ρ_(+l)′ thus obtained, an unknown estimate-set {β′}_(l) is obtained. Using a method similar to Eqs. (34) and (35), let us determine the maximum likelihood set among N_(c)′ sets stated above. Making the maximum likelihood unknown set on the hard decision, the transmitted information detected value {{circumflex over (β)}^(s)} may be obtained.

[0234] For received pilot matrix β40 whose rank reduces by more than two, it can be solved by using additional column vectors A₀, A₁, . . . A_(h−1), row vectors C₀, C₁, . . . C_(h−1) with h (≧2), dummy-information-set {β^(D)}=(β_(M) ^(D), β_(M+1) ^(D), , , , β_(M−h−1) ^(D)), and virtual data elements {d}=(d_(M), d_(M+1), . . . d_(M+h−1)) to convert it to a system of linear Equations with (M+h) unknowns. An effect of regularity improvement will be demonstrated, when the above method is applied to an ordinary system of linear equations.

[0235] [Scrambled Sequence Analysis Method]

[0236] In CDMA transmission systems, the service area is divided into multiple cells, each of which has a base station, and users within a cell communicate with the base station in the cell. By allocating the same frequency band to respective cells, enhancing the frequency utilization efficiency is attempted. As a result, the communication is affected by interference not only from other users within the cell, but also from users in the neighboring cells. As described above, according to the present invention, the k-th user in each cell occupies the comb-tooth shaped frequency-slots in FIG. 6, based on carrier-wave frequencies f_(k)′ and f_(k) in Eq. (18). Therefore, intercell-interference occurs between the pilot-frames of the k-th users in a cell and the neighboring cells, and similar interference does between the data-frames. [In a sector system in which a cell is divided, for example, into six sectors, to eliminate the intercell-interference due to directional antennae, interference from the neighboring sectors, not neighboring cells should be considered.]

[0237] In the previous method in which the k-th user u_(k) uses data carrier-wave f_(k), each user can use the same spreading sequence set (M kinds of sequences), even if considering inter-station-interference within a cell. If the same sequence set can be allocated to users in a neighboring cell, the system design becomes more advantageous. As a means to realize such same sequence method, let us allocate a scrambling code σ_(c)(i)(c=0,1,2, . . . N_(c−1)) inherent to each cell. Assume here that the number of cells causing intercell interference is N_(c)=(7). A user in the c-th cell performs chip base multiplication to both spreading sequences g_(p) and g_(m), producing the following scrambled sequence sets, referring to Eq. (9) $\begin{matrix} \left. \begin{matrix} {{{g_{m}^{c}(i)} = {\left( {{g_{m0}\sigma_{C0}},{g_{m1}\sigma_{C1}},{\ldots \quad g_{{mL} - 1}\sigma_{{CL} - 1}},} \right)\quad \left( {{m = 0},1,2,{{\ldots \quad M} - 1}} \right)}}} \\ {{{\sigma_{C}(i)} = \left( {\sigma_{C0},\sigma_{C1},{\ldots \quad \sigma_{C,{L - 1}}}} \right)}} \end{matrix} \right\} & (75) \end{matrix}$

[0238] g_(p) ^(c)(i) is also produced in the similar manner.

[0239] Conventional CDMA systems often use scrambling system. In this case, the transmitter transmits the above scrambled sequences without converting them to the enveloped frames having the guard sequences previously atated, while the receiver performs descrambling with the scrambling code (used by the transmitter) synchronized to the principal wave of the received signal. Such conventional practice resultantly performs asynchronous descrambling to the delayed waves coming from the desired station, and performs correlationve demodulation to produce odd-correlation-components, so that it may be difficult to utilize the enough energy of the delayed waves for signal detection process.

[0240] According to the present invention, the transmitter produces an enveloped transmit-frame by using the scrambled sequence set as the spreading sequences, while the receiver produces analyzing sequence z(i) in Eq. (25) based on pilot and data scrambled sequence sets g_(p) ^(c)(i) and g_(m) ^(c)(i) similar to those used by the transmitter of the desired station. By using this analyzing sequence, channel-response {μ} is produced. Based on this response and sequence g_(m) ^(c)(i), is produced fabricated pilot-frame r_(pm)*(i) in Eq. (27), with which the synchronously received data-frame is analyzed. In this way, demodulation detection capable of using all the energy of delayed waves coming from the desired station can be achieved, by eliminating the most of the inter-cell or inter-sector interference. Therefore, the present invention can provide the methods far more advantageous in terms of the receiving error rate characteristics.

[0241] [Pilot-Frame Transmission Method]

[0242] The first to fourth embodiment-examples described with reference to FIGS. 2, 4, 9, 10, and 11 have used K orthogonal carrier-waves f_(k)′ to transmit isolated pilot-frames for respective users. Namely, this example corresponds to a frequency-division pilot-frame-transmission-method. In contrast, a time-division pilot-frame-transmission-method may be used. FIG. 12 shows an auxiliary explanatory drawing of the composition of baseband transmit and received frames, similar to FIG. 7.

[0243]FIG. 12(a) shows the k-th transmit signal s^(k)(t) of two users u_(k)(k=0,1) in a data-sharing-channel-type time-division-pilot-transmission-system. The figure shows seven extended frames (with period T_(E)) which include the frame-sequence ordinal number n,n′(n≠n′) at the end of the subscript in s^(k)(t). In this case, pilot-frames s_(pm) ^(k)(t)(n=0,3, . . . ) and data-frames s_(Dn′) ^(k)(t)(n′=−1,1,2,4,5 . . . ) are arranged on the time axis as shown in the figure. This figure indicates the case in which insertion ratio of pilot and data-frames is 1:2 (equivalent to the pilot overhead α_(p)=½ to be described later). s^(k)(t) modulates the carrier-wave with orthogonal frequency f_(k) in Eq. (18) and the modulated output is transmitted from transmitter TX(u_(k)).

[0244] Receiver RX(u₀) extracts the synchronously received frame corresponding to pilot-frame s^(pm) ₀(t) in time-division-manner using the frame pulse. This frame can be used to produce response {μ⁰} with a circuit approximately similar to pilot-signal generating circuit D_(p) ⁰ in FIG. 4, without being subjected to interference from the data-frames or the pilot-frames transmitted by other stations. In this example, using response {μ⁰}₀ produced from s_(p0) ⁰(t), the synchronously received data-frames corresponding to neighboring data-frames s_(D−1) ⁰(t) and s_(D1) ⁰(t) are analyzed as shown in the arrow mark in the figure. Similarly, using the illustrated response {μ⁰}₃, the synchronously received data-frames corresponding to neighboring data-frames s_(D2) ⁰(t) and s_(D4) ⁰(t) are analyzed. For a slow moving speed of the transmitters, the changing rate of a received signal is slow, resulting in a low Doppler shift frequency f_(d). Let the ratio relative with symbol rate f_(I) be

λ=f _(d) /f _(I).  (76)

[0245] The pilot-frame insertion frequency (or α_(p) to be described later) can be reduced, for λ<<1. Note that receiver RX can identify the order of pilot-frames and data-frames using known synchronization technology.

[0246] It is also possible to allocate common comb-tooth shaped frequency-slots to all the users in a cell for pilot-transmission and to allow each user to use the frequency-slots in the time-division-manner. The composition of baseband received frames, received by base station BS using such common pilot-channel-type time-division-transmission-system, is shown in FIG. 12(b). In the figure, r_(p)(t) is a time-sequence (multi-frame) of extended frames on the above common pilot-channel, and the time slot r_(p) ^(k)(t) on the time axis is sequentially allocated to K users (k=0,1,2, . . . K−1) and a synchronizing frame r_(F)(t) is inserted every K pilot-frames.

[0247] On the other hand, the data-frames received by BS is represented as r_(Dn) ^(k)(t)(n=−1,0,1, . . . ). This is a continuous waveform on the k-th carrier-wave f_(k) (or a common carrier-wave f_(D)), which has a composition approximately similar to the data-flock-frame r_(Df)(t) in FIG. 8(b). The receive timings of data-frames r_(D) ^(k)(t) in FIG. 12(b) are illustrated so as to coincide with regard to k, but it does not always coincide completely, because of the quasi-synchronous conditions in Eq. (19) and the delay time of the delayed waves. The time occupancy range of respective received flock-frames r_(pf) ^(k)(t) and r_(Df) ^(k)(t) show different extent around the illustrated time slots for those with different k, and the parts of neighboring flock-frames mutually may overlap.

[0248] The time slot of synchronizing frame r_(F)(t) is supplied by a timing circuit in the receiver of base station BS. The transmit-timing of user u_(k) is controlled so that the synchronously received data- and pilot-frames, r_(D) ^(k)(t) and r_(p) ^(k)(t) may arrive at the center of or near by slot r_(p) ^(k)(t), that is the k-th slot away from this synchronizing frame-slot. Therefore, a certain synchronously-received frame does not contain neighboring flock-frames coming from different users.

[0249] For frequencies f_(p) and f_(k) of carrier-waves carrying r_(p)(t) and r_(D) ^(k)(t) in FIG. 12(b), the following orthogonal relationship is provided, similarly to the cases in Eq. (18) and (60) $\begin{matrix} \left. \begin{matrix} {{f_{p} = f_{00}}} \\ {{f_{k} = {f_{00} + {\left( {k + 1} \right){f_{G}.}}}}} \end{matrix} \right\} & (77) \end{matrix}$

[0250] If this time-division pilot-frame-transmission-method is applied to the common data-channel-method of the third embodiment-example, by replacing f_(k) with f_(D)=f₀₀+f_(G), the number of the carrier-waves of N=2 is obtained as given by $\begin{matrix} \left. \begin{matrix} {{f_{p} = f_{00}}} \\ {{f_{D} = {f_{00} + {f_{G}.}}}} \end{matrix} \right\} & (78) \end{matrix}$

[0251] By designing the required parameter using this principle, RX can receive the isolated pilot-frames without being subjected to any disturbance due to data-frames or pilot-frames coming from other users.

[0252] [Description of the Partial Circuits]

[0253]FIG. 13 shows detailed partial circuits of the receiver used in FIG. 4 and FIGS. 9 to 11. The cross correlation processing function of these circuits is the most important element of demodulating analysis for a CDMA receiver.

[0254]FIG. 13(a) shows the continuous time correlator (matched filter) C_(orl)(q). r(t) is a continuous time received frame waveform [L chip sequence waveform obtained by multiplying g(t) in Eq. (2) by information β is assumed], while q(t) is a continuous time chip-waveform in Eq. (3). Both waveforms are multiplied at the multiplier MOD and the resultant output is applied to the integrator I. If the output of I is applied to the AND-gate A the integrated value r(i) is obtained sequentially with the trigger input d(t) designating the end of integration, as the 0-shift cross-correlation output. Integrator I is reset at every trigger timing point. This circuit is used as C_(or)(q) in FIG. 4. In this case, chip-waveform q(t), that is an element waveform to compose r(t) is assumed as a square wave with chip time width T_(c). If q(t) is an f-shaped sampling function waveform, it is necessary to extend the integration range of I to [−nT_(c)˜nT_(c), n>10]. Therefore, 2n or more correlators must be arranged in parallel to perform the reset function stated above.

[0255]FIG. 13(b) shows a circuit to produce the 0-shift cross-correlation output between discrete time waveform r(i) obtained in Fig (a) and data analyzing sequence y(i). All the processing is performed on the discrete time axis iT_(c). Therefore, when compared with Fig. (a), the integrator I becomes an adder. The trigger point of trigger input d(t) becomes [t=n(LT_(c)), n=0,1,2, . . . L] with the frame number n, and the output Φ_(n) is obtained at every LT_(c). This circuit is used as C_(or)(y_(n)) in FIG. 9.

[0256]FIG. 13(c) shows a matched filter which produces the cross correlation output in Fig. (b) for all the shift positions (τ=0,1,2, . . . L−1). Here is explained an example circuit which obtains cyclic cross-correlation-function between received frame r(i) and pilot analyzing sequence z(i) defined in Eq. (25).

[0257] In the figure, D is a delay circuit by T_(c) seconds; S_(h) is a circuit having such a function as to delay by T_(c)-seconds and to shift sequence z(i) cyclically by one chip; and C_(or)−j(j=0,1,2, . . . J−1) is a correlator similar to Fig. (b). In the figure, the inputs to the j-th correlator C_(or)−j can be viewed as r(i) and z(i−j), when considering them by neglecting the delay time. Accordingly, the output is the zero-shift-correlation-value μ_(j), occurring at the time position delayed by jT_(c). Thus, the sum {μ} of all the correlator outputs is obtained. If all of elements are to be obtained simultaneously, J components of μ_(j) are obtained as parallel outputs by eliminating D and delay function in S_(h)′. (As the input to the correlator is a complex number, the complex processing is performed at each correlator.) This circuit is also used as matched filter MF(z) in FIG. 4.

[0258] [Power Bandwidth Characteristics]

[0259] Let the number of chips v required to transmit one bit, as an evaluation measure indicating the frequency utilization efficiency of this system. v is represented by the following equation $\begin{matrix} {\nu = {\frac{L_{E}}{K\quad I} = \frac{{K\left( {\alpha_{p} + \alpha_{D}} \right)}{L\left( {1 + \alpha_{h}} \right)}}{K\quad I}}} & (79) \end{matrix}$

[0260] where,

[0261] L_(E): Sequence length of extended frame (=L_(G)+2L_(h))

[0262] K: Number of users

[0263] I: Amount of information per symbol-frame [see Eq. (14)]

[0264] L: Length of basic spreading sequence

[0265] L_(h): Length of header sequence (assumed to be equal to the tail sequence)

[0266] L_(G): Length of core-sequence (=NL)

[0267] N: Number of carrier-waves [N=K(1+α_(p))]

[0268] α_(p): Overhead (1) caused by the insertion of pilot-frame

[0269] α_(D): Overhead (1) due to the number of data-frame-transmission-carrier-waves

[0270] α_(h): Overhead (1) due to the addition of data and tail.

[0271] Converting the value of the above equation to the information quantity that can be transmitted over the occupied bandwidth of 1 Hz, approximately (2/v) bits/Hz is obtained. Note that α_(p)<1 can be achieved, when the data-sharing-channel-type- or common pilot-channel-type-time-division-transmission-method as described above is used. When the third embodiment-example as described above is used, α_(D)<1 can be also achieved. When the cell size is relatively small, α_(h) can be reduced. For a large information quaintly I per symbol, a long extended frame-period can be used, consequently ah can be reduced.

[0272] Now let us consider the transmission power of a user located at an average distance from the base station. As the degradation of the error rate characteristics due to additive white Gaussian noise on the pilot-frames is more considerably lager than that due to noise on the data-frames, the pilot-frame power P_(p) must be L-times larger than, according to the basic spreading sequence length, the unit power P_(D0) of data-frame for a case of γ=1. On the other hand, for a low-speed moving body, λ=f_(d)/f_(I)<<1 is established in Eq. (76), therefore, P_(p) can be chosen to be a sufficiently small value by using values obtained by integrating a number of neighboring pilot frame-responses as the pilot response. [Assuming that the number of frames to be integrated is N_(α), the noise power contained in the pilot-response becomes 1/N_(α)] Here, let the total transmission power of each user be as follows

P _(U) =P _(P) +P _(D0)=(η+γ)P _(D0).  (80)

[0273] If λ<<1 and η=P_(P)/P_(D0)<<1 are established, then the power can be reduced to P_(U)≅γP_(D0). Alternatively, instead of reducing η, v can be further reduced by setting α_(p)<<1. With γ=around 2-3, it is not required to consume excessive power for a transmitter of a mobile station which favors low power dissipation.

[0274] Consider applying this invention to the down-link transmission. In this case, a common pilot-frame can be used, so that the number of carrier-waves to be allocated to the pilot-frame transmission may become one, resulting in dramtic reduction in α_(p)=1/K in Eq. (79). The transmit-power of the base-station-transmitter for the down-link, when all the users are located in an average distance, is given by

i P_(R)=(η+Kγ)P _(D0)  (81)

[0275] Since the base-station can practically increase the transmit-power, it is possible to increase γ and resultantly to decrease v. When the maximum value of γ_(m) is used, γ of the above equation should take an average less than γ_(m). The product of the above transmit-power and the chip/bit is a power-bandwidth-product that is required for transmission of one-bit

[0276] information, and given by the following equation

PB=vP  (82)

[0277] where P_(U) or P_(B) is used as P. It is considered that the less PB is the more advantageous the system becomes.

[0278] Now, consider the design-example shown in Table 1. System M γ γ_(m) I K α_(P) α_(D) N L L_(G) Up- X 65 2 13.0 30 1 1 60 10 600 link X′ 65 2 20.0 30 2 1 60 10 600 Y 8 3 8.8 30 1 1 60 8 480 Y′ 8 3 19.6 30 1 1 60 8 480 W 8 3 8.8 30 1 1/30 31 13 403 W′ 8 3 19.6 30 1 1/30 31 13 403 Down- Z 67 4 23.5 30 1/30 1 31 10 310 link Z′ 67 4 65.2 30 1/30 1 31 10 310 System L_(h) L_(E) V P_(U)/P_(B) (× P_(D0)) PB Up- X 60 720 1.85 2 3.7 link X′ 60 720 1.20 1.5 1.8 Y 48 576 2.18 3 6.5 Y′ 48 576 0.98 2 2.0 W 40 483 1.83 3 5.5 W′ 40 483 0.82 2 1.6 Down- Z 31 372 0.53 120 63.6 link Z′ 31 372 0.19 75 14.3

[0279] X, Y, and W are example-systems for up-link-transmission, while Z is one for down-link-transmission. X is also a system shown in FIGS. 2 and 4, Y is of using the cyclic shift single-sequence in FIG. 9, and W is of the data-channel-sharing-method in FIG. 10. Z is a system with f_(k)′=f_(p) in FIGS. 2 and 4. The systems with prime symbol are of using γ_(m), a method in which the maximum value γ_(m) is set and all of γ less than γ_(m). The values of PB (consider {fraction (1/30)} times the values shown in the table for the down-link as the values per user) of systems X, Y, and W take far more favorable values than about 10 that can be achieved by current practical system. As α_(p)=1 is selected in the above design-examples, one pilot-frame per symbol-frame is transmitted, the noise on the pilot frame can be reduced through integration. Therefore, η≅0 may be assumed in Eqs. (80) and (81). Value v in system Z for the down-link is generally lower than that for the up-link, because a common pilot can be used, indicating that advantageous characteristics can be achieved. However, the time-division-transmission-method of pilot may be used for the up-link as well to reduce further v and PB.

[0280] When compared with the systems of using a fixed value for γ, the systems using the maximum value γ_(m) demonstrates further advantageous characteristics. Thus, the present invention can realize systems having extremely higher frequency-utilization-efficiency than that of conventional systems.

[0281] The extended frame-period and header sequence-period are given as follows, when the information-transmission-rate of the system is assumed to be R(bits/sec). $\begin{matrix} \left. \begin{matrix} {{T_{E} = {I\text{/}R}}} \\ {{T_{h} = \frac{T_{E}L_{h}}{L_{E}}}} \end{matrix} \right\} & (83) \end{matrix}$

[0282] T_(h)=10.8 μsec is obtained in the above design-example (X) for R=100 kbps. When the cell radius is assumed to be 1 km, the maximum delay time is τ_(M)≅1.8 μsec. Therefore, τ_(M)<<T_(h) indicates that the quasi-synchronous condition in Eq. (19) is sufficiently satisfied.

[0283] Note that the present invention has an ideal Rake-reception-function. This function is also called path-diversity, which utilizes the source power of not only the direct wave but also multiple delayed waves, resulting in improvement of the error rate characteristics. Moreover, by adding the two kinds of sequence extending methods to the systems shown in Table 1, the number of sequences, M, or the number of users, K can be increased, resultantly materializing extremely superior systems which are capable of reducing value PB to a fraction of the values shown in the table.

[0284] According to the present invention described in claim 1, as described for the first embodiment-example, in order to transmit transmit-information of I bit per symbol, a transmitter creates M kinds of enveloped sequences in which guard sequences are added to a repeated spreading sequence, from which γ components are selected to produce an original information set {β} consisting of (M−γ) components of 0 and γ components of non-0. Using this set, a selected information-set {β^(s)} consisting of γ components is produced. By modulating the respective selected enveloped sequences with {β^(s)}, a baseband data-frame is produced. In the similar manner, using one pilot basic sequence, an isolated pilot-frame is produced. Each data-frame modulates an orthogonal individual carrier-wave so that data-frames transmitted by respective users may not be interfered one another, generating a frequency-division type radio-band transmit-data-frame to be transmitted. A receiver receives data-flock-frame and pilot-flock-frame corresponding to the previously-described transmitted frames, analyzes the former on the basis of accurate channel responses produced from the demodulated output of the latter, and estimates the influence of interference-wave-components from the analytical result. As a consequence, the receiver eliminates the influence of interference-components from the received demodulated components, so that transmit-information of I (for example, I=13 with M=65 and γ=2) per symbol can be detected without being subjected to interfering disturbance. In consequence, a high frequency-utilization-efficiency is achieved. Moreover, the transmit-power can be kept low, unless an excessively large value is selected for γ so that this method may be applied to an up-link-transmission.

[0285] The invention according to claim 2 shows a direct analysis method used by a receiver which operates for the transmit-functions of the invention according to the above claim 1. In the receiver, a pilot-matrix is produced from both channel responses produced from synchronously received pilot-frames and the respective spreading sequences, and a received data-matrix is produced based on a synchronously received data-frame. With the direct analysis method solving a system of linear equations in M unknowns, produced using of these matrices and an unknown matrix, respective transmitted information can be detected without being subjected to the disturtance due to the other spreading sequence components transmitted simultaneously.

[0286] Therefore, even when the number of sequences of spreading sequence population M or the number of selected sequences γ is excessively large, for example, an estimate value β₀ ^(s′) of information β₀ ^(s) carried by the 0-th spreading sequence g₀ ^(s) can be obtained without being subjected to the disturbance due to the other spreading sequence g_(m) ^(s)(m≠0) components transmitted simultaneously. Moreover, this analysis is performed on the basis of the channel response obtained with an isolated pilot, and it utilizes the same received signal power as that of an ideal Rake-reception. Therefore, this method is effective in achieving excellent error rate versus SN (signal/noise) ratio characteristics.

[0287] The invention according to claim 3 is a method to transmit the respective user data-frames with a common carrier-wave f_(D), over the common comb-tooth shaped frequency-slots, where the k-th user transmitter transmits the pilot-frame using frequency-division-transmission with the carrier-wave f_(k)′ over the k-th comb-tooth shaped frequency-slots. Namely, this method is effective in saving the bandwidth to be occupied, because all the users share the same bandwidth for data-transmission.

[0288] The invention according to claims 4, 5, and 6 is methods related to the transmission of accurate pilot-frames. The transmitter provides an enveloped sequence, in which guard sequences are added to a core sequence made by repeating a basic spreading sequence for pilot. When transmitting the baseband transmit-pilot-frame made by multiplying the enveloped sequence by the pilot information, such synchronizing technology is provided that the received timing deviation of flock-frames which the receiver received from respective user stations may be kept within the range of guard sequences. In addition, respective users transmit the transmit-pilot-frames over the respective comb-tooth shaped frequency slots in frequency-division-manner by using carrier-waves with mutually-orthogonal frequencies (belong to a carrier-wave set with the frequency interval which is the reciprocal of the synchronously received frame-period). As a consequence, the pilot-frame concerned may have the orthogonal relationship with the data-frames transmitted by all the stations or the pilot-frames transmitted by the other stations. Alternatively, such technology is provided, that the pilot-frame uses a carrier-wave with the same orthogonal frequency as the data-frame and it is transmitted in the time-division manner with the data-frame. Alternatively, such frequency-division, time-division combined technology is provided, that with all the pilot-frames are transmitted on the time axis of common pilot-frame in time-division-manner by using a carrier-wave common to user stations.

[0289] According to the present invention, the receiver can receive an accurate isolated pilot of the desired station, without being disturbed by the interference due to the data-frame of the own station as well as pilot- and data-frames transmitted by the other users, and can produce an exact channel response based on the received pilot. The error rate versus SN ratio characteristics of the embodiment-examples according to the present invention can be remarkably improved due to high purification of this pilot. The time-division-transmission of pilot-frame is advantageous in that the pilot overhead can be reduced.

[0290] The invention according to claims 7 and 8 uses the correlation analysis method, instead of the orthogonal analysis method of the receiver described in claim 2. Namely, the correlation-functions of synchronously received pilot- and data-frames with the same analyzing sequence y is obtained, and using its outputs, that are the pilot-response and data-response, a system of linear equations with size M×M is established, and by solving it the transmitted information is obtained. This method is free from a restriction of limiting the size to the sequence length L, and can produce a system with size M xM for M kinds of sequences prepared in the transmitter. Besides, this method enables the analysis focused on specific sequence components, which is effective in increasing the degree of freedom in solving the equations.

[0291] The invention according to claims 9 and 10 is such technology is provided that the effective length of pilot (response)-matrix is doubled by means of the complex-number developed type sequence extended method, the dimensions of the system of linear equations is doubled. Namely, according to this technology, the sequence length of synchronously received data-frame r_(D)* which the receiver has received is equal to the sequence length L of transmission basic spreading sequence, but the L components of chip elements with the r_(D)* complex amplitude are separated into the real and imaginary parts. The imaginary part is assumed as a new real part, and both real parts are added to make up a double-length sequence-frame for analysis.

[0292] The invention according to claims 11 and 12 is such technology that the dimensions may be increased by means of sequence extending with transmission-diversity and diversity-reception. Namely, N_(v) pieces of transmit-diversity-antennas and N_(d) pieces of receive-diversity-antennas are provided, respectively, on the output side of the transmitter and on the input side of the receiver, and plural (N_(d)) received inputs are applied to plural (N_(v)N_(d)) pieces of pilot- and data-receive-blocks which have such functions as pilot-signal-demodulation, channel-response-generation, fabricated-pilot-frame-generation, and data-frame-demodulation. The respective N_(v)N_(d) fabricated pilot-frames with L chip elements which are the outputs from these blocks are aligned on the time axis, generating an exptended fabricated pilot-frame with effective sequence-length N_(v)N_(d)L. On the other hand, N_(v)N_(d) of data-frames with L chip elements, which are outputs from the above blocks, are similarly aligned to produce an extended data-frame. Thereby the dimensions of the system of linear equations can be increased to N_(v)N_(d)L.

[0293] The invention according to claim 13 is such technology that the sequence extending technology according to claim 9 or 10 and claim 11 and 12 may be combined. Thus, the invention according to claims 9 to 13 provides such technology as to increase the effective length of spreading sequences to be processed by the receiver. The technology not only enhances the regularity of said receive-pilot-matrix and pilot-response-matrix, but also increases the number of sequences M or the number of available users K to be accommodated. Therefore, the technology is effective in enhancing the frequency-utilization-efficiency of the systems, while reducing the power-bandwidth-product.

[0294] The invention according to claims 14, 15, 16, and 17 is such technology that problems taking place whenever the kinds M of basic spreading sequences prepared by the transmitter is excessively larger than the spreading sequence length (real spreading sequence length) may be overcome. On the above-stated condition, the rank of pilot-matrix and pilot-response-matrix produced in claims 2, 3, and 7 to 13 tends to reduce. By utilizing such character that the number γ of selected sequences to be transmitted is sufficiently smaller than M or the spreading sequence length, plural virtual solution sets are obtained. By introducing an evaluation function indicating the difference from the true values, one of these virtual solutions (sets) is determined as the maximum likelihood solution (set). Since this allows M to increase, there is an effect in improving the frequency-utilization-efficiency.

[0295] The invention of claim 18 enables an increase in the information quantity per symbol and thereby improves the frequency-utilization-efficiency, by allowing selection of γ under a condition of γ≦γ_(m), instead of fixing γ, that is the number of the spreading sequences to be transmitted by the transmitter. This technology can be achieved only when used together with the high-level interference-wave-elimination technology of the present invention.

[0296] The invention according to claims 19 and 20 is such technology as to add h(≧1) dummy information and an additional column vector A into the system of M linear equations. In the case of claim 20, by adding an additional column vector A and an additional row vector C, it is converted into a system of (M+h) linear equations, thereby the regularity of the pilot (response) matrix may be enhanced by selecting the additional vector A, when solving a system of M linear equations the receiver has produced by based on pilot-response-matrix and data-frame-response. Note that, in claim 20, the additional row vector C is selected to obtaine the maximum likelihood solution. This technology is effective in minimizing the influence to the solution due to the noise and error components contained in the pilot-response-matrix by enhancing the regularity.

[0297] The invention according to claim 21 is to provide such technology that respective users in each cell generate a scrambled spreading sequence set inherent to the cell based on the M kinds of common basic spreading sequence-set, as the M kinds of basic spreading sequences, by allocateing a cell-inherent scrambling sequence to each cell. Despite users, mobile stations, move to and from in many cells, they can always use the same basic sequence set in the all cells, thereby of the system scale can be simplified. Moreover, in this invention, the receiver produces the above scrambled sequence set and performs demodulation analysis based on the said principle using this set and the channel response. Therefore, the superior interference (due to inter-cell and intra-cell) separation function can be achieved and effective utilization of all the energy of delayed waves coming from the desired station can be utilized. Therefore, this method realizes more advantageous transmission characteristics than that of conventional systems.

[0298] The invention according to claim 22 provides M′N kinds of sequence population made by multiplying M′ kinds of basic spreading sequences by Hadamarl codes with size N×N. A transmitter produces data-frames by selecting γ components of the spreading sequences from the population, and transmits it. The present invention is effective in generating multiple kinds of spreading sequence sets with small cross-correlation based on a few basic spreading sequences for transmission.

[0299] The invention according to claim 23 provides LM′ kinds of sequence population in correspondence to the spreading sequence length L, by producing the cyclically shifted sequences based on each spreading sequence of M′ kinds of basic spreading sequences, and then adding them to the basic spreading sequences. A transmitter produces data-frames by selecting γ components of the spreading sequences from the population, and transmits it. The receiver obtaines a data analyzing sequence corresponding to the basic spreading sequence, and prepares M′ pieces of matched filters which are matched to the analyzing sequences, outputting M=LM′ pieces of correlation-outputs. By solving a system of linear equations in M unknowns based on such outputs, the transmitted information is detected. Accordingly, LM″ pieces of sequence populations can be used on the basis of M′ kinds of sequences, so that the information quantity per symbol may increase. Application of the present invention technology to down-link-transmission enables the use of a common pilot-frame. Besides, the down-link has the synchronous transmission characteristics, so that the number of guard-chips can also be reduced, thus reducing the overhead of pilot- and guard-sequences. Consequently, a higher frequency-utilization-efficiency for the down-link than that for the up-link can be achieved.

[0300] Consider the application of the present invention to radio LAN. Since LAN is a stationary system, the transmitting frequency of pilot-frames can be decreased. Therefore, the overhead for pilot-transmission can be reduced by the use of a common carrier-wave for pilot-frame-transmission. As a result, a high frequency-utilization-efficiency may be achieved.

[0301] For the reason described above, application of the transmission technology according to the present invention to cellular mobile communication systems or radio LAN systems will achieve remarkable performance. When the additional vector type high accuracy solution method according to the present invention is applied to all systems requiring the solution of a system of linear equations containing noise and error components in multiple unknowns, remarkable effects can be obtained. 

1. A CDMA communications system using multiple spreading sequences is characterized by the fact that, in a direct-sequence spread-spectrum CDMA communications system, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises such a function as to transmit information of I bits per symbol-frame by providing; means of that a sequence-set consisting of M kinds of basic spreading sequences g₀, g₁, . . . g_(m), . . . g_(M−1), each sequence having code length L, is prepared, an information-set consisting of γ components, {β^(S)}=(β₀, β₁, . . . β_(γ−1)) not including the value 0 is made of a modulated sequence-set which are made by multiplying the said M respective basic spreading sequences by an original information-set consisting of M components {β}=(β₀, β₁, . . . β_(M−1)) including (M−γ) pieces of the value 0, resulting in production of a selected sequence-set consisting of γ selected spreading sequences, means of that a modulated synthesized sequence SD is produced by adding up all of the said selected spreading sequences, that a repeated core spreading sequence s_(DN) with a sequence length of NL is produced by repeating the said respective selected sequences an integer (N) times, that an enveloped sequence e_(D) is produced as an baseband transmitting data-frame by arranging the rear and the front parts of the said repeated core spreading sequence as the guard sequences at the front and the rear outsides of the said repeated core spreading sequence, and that said data-frame modulates a carrier-wave having the k-th orthogonal frequency f_(k) which is orthogonal each other on k and the resultant output is transmitted, and means of that a similar enveloped sequence e_(p) is produced based on a sequence pg_(p) which is made by multiplying a basic spreading sequence g_(p) for pilot by a pilot-information p as a baseband transmit-pilot-frame, and that the said pilot-frame is transmitted so as not to interfere with similar data-frames and pilot-frames of other users, and a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that a received signal is demodulated into a baseband signal using a local carrier-wave {circumflex over (f)}₀ of the 0-th orthogonal frequency f₀ which the transmitter of a desired user u₀ has used, that a synchronously received frame period with a length of NL chips is set at the position which is synchronized with the principal wave of signal components coming from the desired user included in this demodulated output, that the baseband signal component on this period is extracted as a repeated synchronously received data-frame r_(DN)*, and a repeated synchronously received pilot-frame r_(pN)* is also obtained in the same way, and that by applying an averaging operation to the said respective repeated frames, a synchronously received data-frame r_(D)* and a synchronously received pilot-frame r_(p)* both with reduced length L chips are produced, means of that the said synchronously received data-frame r_(D)* is analyzed using a channel response {μ} which is the demodulated output of the said synchronously received pilot-frame, resulting in production of an estimate-set {β′}=(β₀′, β₁′, . . . β_(M−1)′) corresponding to the said original information-set which has been transmitted by the desired station, and means of that a detected output-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)} consisting of the information which the desired station has transmitted is obtained by judging the said estimate-set.
 2. A CDMA communications system using multiple spreading sequences is characterized in that, in a direct-sequence spread-spectrum CDMA communications system, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises such a function as to transmit information of I bits per symbol-frame by providing; means of that a sequence-set consisting of M kinds of basic spreading sequences g₀, g₁, . . . g_(m), . . . g_(M−1), each sequence having code length L, is prepared, an information-set consisting of γ components, {β^(S)}=(β₀, β₁, . . . β_(γ−1)) not including the value 0 is made of a modulated sequence-set which are made by multiplying the said M respective basic spreading sequences by an original information-set consisting of M components {β}=(β₀, β₁, . . . β_(M−1)) including (M−γ) pieces of the value 0, resulting in production of a selected sequence-set consisting of γ selected spreading sequences, means of that a modulated synthesized sequence s_(D) is produced by adding up all of the said selected spreading sequences, that a repeated core spreading sequence s_(DN) with a sequence length of NL is produced by repeating the said respective selected sequences an integer (N) times, that an enveloped sequence e_(D) is produced as an baseband transmitting data-frame by arranging the rear and the front parts of the said repeated core spreading sequence as the guard sequences at the front and the rear outsides of the said repeated core spreading sequence, and that said data-frame modulates a carrier-wave having the k-th orthogonal frequency f_(k) which is orthogonal each other on k and the resultant output is transmitted, and means of that a similar enveloped sequence e_(p) is produced based on a sequence pg_(p) which is made by multiplying a basic spreading sequence g_(p) for pilot by a pilot-information p as a baseband transmit-pilot-frame, and that the said pilot-frame is transmitted so as not to interfere with similar data-frames and pilot-frames of other users, and a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that a received signal is demodulated into a baseband signal using a local carrier-wave to {circumflex over (f)}₀ the 0-th orthogonal frequency f₀ which the transmitter of a desired user u₀ has used, that a synchronously received frame period with a length of NL chips is set at the position which is synchronized with the principal wave of signal components coming from the desired user included in this demodulated output, that the baseband signal component on this period is extracted as a repeated synchronously received data-frame r_(DN)*, and a repeated synchronously received pilot-frame r_(PN)* is also obtained in the same way, and that by applying an averaging operation to the said respective repeated frames, a synchronously received data-frame r_(D)* and a synchronously received pilot-frame r_(P)* both with reduced length L chips are produced, means of that M kinds of fabricated pilot-frames r_(pm)*(m=0,1,2, . . . M′−1) each having a length of L chips are produced by using both the channel response (μ) which is the demodulated output of the said synchronously received pilot-frame and the above-described sequence-set consisting of M kinds of basic spreading sequences, resulting in production of a pilot matrix p with a size of L×M, and means of that a system of M linear equations in M unknowns is made of the said pilot-matrix ρ, a received data-matrix d′=(d₀′, d₁′, . . . d_(L−1)′)^(T) consisting of the chip-elements of the above-described synchronously received data-frame r_(D)*, and an unknown matrix β′=(β₀′β₁′ . . . β_(M−1)′)^(T), that an estimate-set {β′}=(β₀′, β₁′ . . . β_(M−1)′) corresponding to the original information-set is produced by solving the said system, and that a detected output-set {{circumflex over (β)}^(S)}=({circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)) consisting of the information-set which the desired user has transmitted is obtained by judging the said estimate-set.
 3. A CDMA communications system using multiple spreading sequences is characterized in that, in a direct-sequence spread-spectrum CDMA communications system, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises such a function as to transmit information of I bits per symbol-frame by providing; means of that a sequence-set consisting of M′ kinds of basic spreading sequences (g₀ ^(k), g₁ ^(k) . . . g_(m) ^(k) . . . g_(M′−1)), each having a sequence length of L chips, is prepared, an information-set consisting of γ components, {β^(kS)}=(β₀ ^(kS), β₁ ^(kS), . . . β_(γ−1) ^(kS)) not including the value 0, is made of a modulated sequence-set which is made by multiplying the said M′ respective basic spreading sequences by an original information-set consisting of M′ components {β^(k)}=(β₀ ^(k), β₁ ^(k), . . . β_(M′−1) ^(k)) including (M′−γ) pieces of the value 0, resulting in production of a selected sequence-set consisting of γ selected spreading sequences {β^(kS)g^(kS)}=(β₀ ^(kS)g₀ ^(kS), β₁ ^(kS), g₁ ^(kS) . . . β_(γ−1) ^(kS)g_(γ−1) ^(kS)), means of that a modulated synthesized sequence s_(D) ^(k) is produced by adding up all of the said selected spreading sequences, that a repeated core spreading sequence s_(DN) ^(k) with a sequence length of NL is produced by repeating the said synthesized sequences an integer (N) times, that an enveloped sequence e_(D) ^(k) is produced as an baseband transmitting data-frame by arranging the rear and the front parts of the said repeated core spreading sequence as the guard sequences at the front and the rear outsides of the respective sequences, and that the said data-frame e_(D) ^(k) modulates a carrier-wave having a frequency f_(D) which is a common carrier for data, and the resultant output is transmitted, means of that a similar enveloped sequence e_(p) ^(k) is produced using a sequence pg_(p) which is made by multiplying a basic spreading sequence g_(p) for pilot by a pilot-information p as a baseband transmit-pilot-frame, and the said pilot-frame modulates a carrier-wave having an orthogonal frequency f_(k)′, and the resultant output is transmitted, and means of that all of the frequencies f_(D) and f_(k)′are set so as to be different each other by integer times of a frequency f_(G) corresponding to the reciprocal of the synchronously received frame-period with length NL chips, and a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that a received signal is demodulated into baseband signals using local carrier-waves {circumflex over (f)}_(k)′ and {circumflex over (f)}_(D) respectively having orthogonal frequencies f_(k)′ and f_(D) which the transmitter has used, that a synchronously received frame-period with a length of NL chips is set so as to satisfy a quasi-synchronous condition, that a repeated synchronously received data-frame r_(DN)* and a repeated synchronously received pilot-frame r_(pN) ^(k*) are produced by extracting the baseband signal components on this period, and that a synchronously received data-frame r_(D)* and a synchronously received pilot-frame r_(p) ^(k*) both having a reduced length of L chips are produced by applying an averaging operation to the said respective repeated frames, means of that M′ kinds of fabricated pilot-frames r_(pm) ^(k*)(m=0,1,2, . . . M′−1) each having a length of L chips are produced by using both the channel response (μ) which is the demodulated output of the said synchronously received pilot-frame and the above-described sequence-set consisting of M′ kinds of basic spreading sequences, resulting in production of a pilot-matrix ρ′ with a size of L×M using M=KM′ pieces of the fabricated pilot-frames, and means of that a system of M linear equations in M unknowns is made of the said pilot-matrix ρ′, a received data-matrix d′=(d₀′, d₁′, . . . d_(L−1)′)^(T) consisting of the chip-elements of the above-described synchronously received data-frame r_(D)*, and that an estimate-set {β^(k′)}=(β₀ ^(0′)β₁ ^(0′) . . . β_(M′−1) ^(0′), β₀ ^(1′)β₁ ^(1′) . . . β_(M═−1) ^(1′), β₀ ^(K−1′)β₁ ^(K−1′) . . . β_(M′−1) ^(K−1′))^(T), corresponding to the original information-set which the k-th user has transmitted is produced by solving the said system, and that a detected output-set {{circumflex over (β)}^(kS)}=({circumflex over (β)}₀ ^(kS), {circumflex over (β)}₁ ^(kS), . . . {circumflex over (β)}_(γ−1) ^(kS)) consisting of the above-described transmitted information for the k-th user is obtained by judging the said estimate-set.
 4. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 2, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises; means of that a transmitting pilot-frame e_(p) which is an enveloped sequence produced based on a basic spreading sequence g_(p) for pilot described above is transmitted over a carrier-wave with an orthogonal frequency f_(k)′, that the said orthogonal frequencies f_(k)′ and f_(k)(k=0,1,2, . . . K−1) used for transmitting the above-described pilot-frames and data-frames respectively are set so as to be different on k each other by integer times of a frequency f_(G) which is the reciprocal of the repeated synchronously received frame period T_(G), resulting in providing of the frequency-division-pilot-frame-transmission-function by setting the sequence length of the above-described guard sequences so that any boundaries of the respective received flock-flames r_(pf) ^(k) and r_(Df) ^(k) coming from all the users may not be included in the synchronously received frame period, and a receiver comprises; means of that the said synchronously received pilot-frame is demodulated using a local frequency {circumflex over (f)}₀ corresponding to the orthogonal frequency f₀′ which the transmitter of desired station u₀ has used, and means of that an isolated-pilot-response for a desired station without being subjected to interference due to both the above-described data-frame received from a desired station and all the interference-waves received from interfering stations is produced.
 5. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 2, a transmitter of the k-th user u_(k) comprises; means of that a synthesized frame-sequence is produced by providing empty slots in the above-described baseband transmit-data-frame sequence, and inserting pilot-frames in said data-frame sequence in time-division manner, and means of that the said synthesized frame-sequence is transmitted over the above-described k-th orthogonal carrier wave having frequency f_(k), and a receiver comprises; means of that the parts corresponding to the pilot-frames in a frame-sequence made of the above-described-synchronously received frames are extracted in a time-division manner and then the extracted parts is demodulated, and an isolated-pilot-response without being subjected to interference due to the above-described interference-waves is produced.
 6. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 3, a transmitter of the k-th user u_(k)(k=0,1, . . . K−1) comprises; means of that a transmit-pilot-frame for u_(k) which is produced by modulating a common carrier-wave for pilot having an orthogonal frequency f_(p) by the k-th baseband transmitting pilot-frame described above e_(p) ^(k) is transmitted over such a transmission timing as to receive in time-division-manner with a similarly received pilot-frame which the k′-th user u_(k′)(k′≠k) has transmitted, and a receiver comprises; means of that a baseband pilot-frame for u_(k) is demodulated in time-division-manner from a pilot-frame-sequence demodulated by a carrier-wave having the said orthogonal frequency f_(p), and the above-described channel-response is produced using the resultant demodulated output.
 7. A CDMA communications system using multiple spreading sequences is characterized in that, in claim 2, a receiver detects the transmitted information of I bits per symbol-frame by comprising; means of that the 0-shift-correlations p_(nm)′ between the m-th fabricated pilot-frame r_(nm)* and M data analyzing sequences y_(n)(n=0,1,2, . . . M−1) each of which differs each other are produced, and that a pilot-response-matrix P′ with a size of M×M constituted of the said correlations is produced, means of that a data-response-matrix Φ′=(Φ₀′, Φ₁′, Φ₂′, . . . Φ_(M−1)′)^(T) is produced by such a method as to obtain the 0-shift correlation Φ_(n)′ between the above-described synchronously received data-frame r_(n)* and the n-th data analyzing sequence y_(n), and means of that a system of M linear equations in M unknowns are made of the pilot-response-matrix P′, the data-response-matrix Φ′ and an unknown matrix β′=(β₀′, β₁′, β₁′, . . . β_(M−1)′)^(T) that an estimated set β′−(β₀′, β₁′, β₁′, . . . β_(M−1)′) corresponding to the said original information-set is obtained by solving the said system, and that a detected output-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)} consisting of the above-described transmitted information is obtained by judging the said estimate-set.
 8. A CDMA communications system using multiple spreading sequences is characterized in that, in claim 3, a receiver detects the transmitted information of I bits per symbol-frame which is transmitted by each user by comprising; means of that M′ fabricated pilot-frames r_(pm) ^(k*) and M′ data analyzing sequences y_(n) ^(k)(n=0,1,2, . . . M′−1) corresponding to the k-th user u_(k)(k=0,1,2, . . . K−1) are produced, means of that a pilot-response-matrix P′ with a size of (M×M) constituted of the 0-shift-correlations p_(nm) ^(k′) between the said respective fabricated pilot-frames r_(pm) ^(k*) and the said respective data analyzing sequences y_(n) ^(k) is produced, and means of that a data-response-matrix Φ′=(Φ₀ ^(0′), Φ₁ ^(0′), . . . Φ_(M′−1) ^(0′), Φ₀ ¹, Φ₁ ¹, . . . Φ_(M′−1) ¹, . . . Φ₀ ^(K−1), Φ₁ ^(K−1), . . . Φ_(M′−1) ^(K−1))^(T) is produced using such a method as to obtain the 0-shift-correlation Φ_(n) ^(k′) between the above-described synchronously received data-frame r_(D)* and the said data analyzing sequence y_(n) ^(k), that a system of M linear equations in M unknowns is made of the said pilot-response-matrix P′, the said data-response-matrix Φ′ and an unknown matrix β′=(β₀ ^(0′), β₁ ^(0′), . . . β_(M′−1) ^(0′), β₀ ^(1′), β₁ ^(1′), . . . β_(M′−1) ^(1′), β₀ ^(K−1), β₁ ^(K−1), . . . β_(M′−1) ^(K−1))^(T), that an estimate-set {β^(k′)}(β₀ ^(k′), β₁ ^(k′), . . . β_(M′−1) ^(k′)) corresponding to the transmitted information-set consisting of M′ components for each user is obtained by solving said system, and that a detected output-set {{circumflex over (β)}^(k′)}({circumflex over (β)}₀ ^(kS), {circumflex over (β)}₁ ^(kS), . . . {circumflex over (β)}_(γ−1) ^(kS)) corresponding to the transmitted information of each user is obtained by judging the estimate-set.
 9. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 2 and 7, a transmitter of the k-th user u_(k) comprises; means of that a sequence-set consisting of M kinds of basic spreading sequences having L chips is prepared, being transmitted, and a receiver detects the transmitted information of I bits per symbol-frame which is transmitted by each user by comprising; means of that double length fabricated pilot-frames r_(pmE)* and a double length synchronously received data-frame r_(DE)* both having 2L chips are produced using the real part and the imaginary part of the respective chip-elements of both the fabricated pilot-frames r_(Pm)*(m=0,1,2, . . . M−1) and the synchronously received data-frame r_(D)*, that a system of M linear equations in M unknowns is made of a double length received pilot-matrix ρ′ with a size of 2L×M made of the double length fabricated pilot-frames r_(PmE)*, a received data-matrix d′ which consists of the chip-elements of the double length synchronously received data-frame r_(DE)*, and an unknown matrix β′, that an estimate-set {β′} corresponding to the original information-set is produced by solving the said system, and that a detected output-set {{circumflex over (β)}^(S)} consisting of the information which the desired station has transmitted is obtained by judging the said estimate-set.
 10. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 3 and 8, a transmitter of the k-th user u_(k) comprises; means of that a sequence-set consisting of M kinds of basic spreading sequences having L chips is prepared, being transmitted, and a receiver detects the transmitted information of I bits per symbol-frame which is transmitted by each user by comprising; means of that double length fabricated pilot-frames r_(pmE) ^(k*) and a double length synchronously received data-frame r_(DE)* both having 2L chips are produced using the real part and the imaginary part of the respective chip-elements of the fabricated pilot-frames r_(pm) ^(k*)(m=0,1,2, . . . M−1, k=0,1,2, . . . K−1) and the synchronously received data-frame r_(D)*, that a system of M linear equations in M unknowns is made of a double length received pilot-matrix ρ′ with a size of 2L×M made of the double length fabricated pilot-frame r_(pmE) ^(k*), a received data matrix d′ which consists of the chip-elements of the double length synchronously received data-frame, and an unknown matrix β^(k′), that an estimate-set {β^(k′)} corresponding to the original information-set is produced by solving the said system, and that a detected output-set {{circumflex over (β)}^(kS)} consisting of the information which the desired station has transmitted is obtained by judging the said estimate-set.
 11. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 3, 7 and 8, a transmitter comprises; means of that transmit-signals are transmitted via one or plural transmit-diversity-antennae A_(Tv)(v=0,1,2, . . . ), and a receiver comprises; means of that received signals rd are received via plural receive-diversity-antennae A_(RD)(d=0,1,2, . . . ), that baseband demodulated outputs are produced at pilot and data demodulating parts D_(pd) and D_(Dd) for the d-th received signal r_(d) by using a local carrier-wave corresponding to a carrier-wave which the transmitter of a desired station has used, and thereby the d-th synchronously received pilot- and data-frames r_(pd)* and r_(Dd)* are produced, that the d-th channel response {μ}_(d) is obtained with the d-th pilot-frame r_(pd)*, that a fabricated pilot-frame r_(pmd)* or r_(pmd) ^(k*) corresponding to the d-th received signal is obtained using the said channel response {μ}_(d) and the m-th basic spreading sequence which the desired station has used, that extended fabricated pilot-frames r_(pmE)* or r_(pmE) ^(k*) are produced by using such a method as to increase the frame length by arranging chip-elements of the said fabricated pilot-frames which belong to the mutually different antenna numbers d on a time axis, that an extended synchronously received data-frame r_(DE)* is produced by arranging the said d-th synchronously received data-frame r_(Dd)* on a time axis in the same way, that an estimate-set {β′}=(β₀′, β₁′, . . . β_(M−1)′) corresponding to the original information-set is produced by analyzing the said extended synchronously received data-frame r_(DE)* with the said extended fabricated pilot-frames r_(PmE)* or r_(PmE) ^(k*), and that a detected output-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)}consisting of the information which the desired station has transmitted is obtained by judging the said estimate-set.
 12. A CDMA communications system using multiple spreading sequences is characterized in that, in claim 11, a transmitter comprises; means of that a sequence-set consisting of N_(v) basic spreading sequences {g_(m)′}=(g_(m0), g_(m1), . . . g_(mv), . . . g_(m,Nv−1)) per one transmit-information β_(m) is prepared, that the v-th basic spreading sequence g_(mv) is modulated by the same information β_(m) to produce a core-sequence for data and then an enveloped sequence for data based on this modulated output, that an enveloped sequence for pilot is produced in the same way, that both the said enveloped sequences are lead to the v-th transmit-diversity-antenna A_(Tv) to transmit, and a receiver comprises; means of that the components which the v-th transmit-diversity-antenna A_(Tv) has transmitted are demodulated based on an input received via the d-th received-diversity-antenna A_(Rd), resulting in production of both the d-th synchronously received data-frames r_(Dvd)* and the d-th synchronously received pilot-frames r_(pvd)*, that a channel response {μ}_(vd) from the v-th transmit-antenna to the d-th received-antenna is produced using the said synchronously received pilot-frame, that the d-th fabricated pilot-frames r_(pmvd)* or r_(pmvd) ^(k*) are produced using the channel response, that an extended fabricated pilot-frame r_(pmE)* or r_(pmE) ^(k*) is produced by such a method as to increase the frame length by arranging chip-elements of fabricated pilot-frames which belong to the respective pairs of transmit- and receive-antenna numbers v and d (mutually different)* on a time axis, that an extended received frame r_(DE)* is produced by arranging the said synchronously received frame r_(Dvd)* in the same way, and that the said extended synchronously received frame r_(DE)* is analyzed with the said extended fabricated pilot-frames r_(pmE)* or r_(pmE) ^(k*).
 13. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 11 and 12, such a function is added that, when the elements of the above-described fabricated pilot-frames and synchronously received data-frames which belong to the mutually different transmit- and receive-antenna ordinal numbers are arranged on a time axis, and thereby extended fabricated pilot-frames and extended synchronously received data-frames are produced, a real amplitude component and an imaginary amplitude component of a chip-element are arranged so as to take individual time positions to constitute each frame.
 14. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 2, 3, and 7 to 12, a receiver comprises such a function as to detect the transmitted information of I bits per symbol-frame which is transmitted by each user by providing; means of that instead of solving a system of M linear equations in M unknowns, an optional number M_(R) which is smaller than M, and equal to γ or larger than γ is chosen to produce a reduced size system of M_(R) linear equations in M_(R) unknowns, and N_(R) sets of the reduced size systems are produced, that N_(R) estimate-sets of the spreading sequence-set {β′}=(β₀′, β₁′, . . . β_(MR−1)′) or {β^(k′)}=(β^(k′), β₁ ^(k′), . . . β_(MR−1) ^(k′)) are obtained as solutions of the said respective equations, and that an evaluation function Δβ which shows deviations between the said respective estimate-sets and the original information-set {β} or {β^(k)} is obtained, and means of that an estimate-set {β′} or {β^(k′)} corresponding to the original information-set based on a set with which Δβ takes the minimum is obtained, and that a detected information-set {{circumflex over (β)}^(S)} or {{circumflex over (β)}^(kS)} consisting of the above-described transmitted information is obtained by judging the said estimate-set.
 15. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 2, 7, 9, and 11 to 13, a receiver comprises such a function as to detect the transmitted information of I bits per symbol-frame which is transmitted by each user by providing; means of that instead of solving a system of M linear equations in M unknowns, combination-sets U_(s)(s=0,1, . . . N_(γ)−1) which consists of γ frames taken out of the fabricated pilot-frames r_(pm)(m−0,1,2, . . . M−1) is made, that a sum of the frames which is made by multiplying the elements of plural virtual sequences C_(h)(c₀, c₁, . . . c_(γ−1)) by the respective frames of a said combination-set U_(s) is produced as a fabricated transmitted frame F_(sh), and that correlations between respective fabricated transmitted frames and the above-described synchronously received data-frame r_(D)* are obtained, and means of that the maximum likelihood fabricated transmitted frame is obtained based on the said correlations, and that a detected information-set {{circumflex over (β)}^(S)} consisting of the above-described transmitted information is obtained by judging the said estimate-set {β′} using the constituent elements U_(s) and C_(h) of the maximum likelihood fabricated transmitted frame.
 16. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 3, 8, and 10 to 13, a receiver comprises such a function as to detect the transmitted information of I bits per symbol-frame which is transmitted by the k-th user u_(k) by providing; means of that instead of solving a system of M linear equations in M unknowns, combination-sets U_(S) ^(k)(s=0,1,2, . . . N_(γ)−1) which consists of Kγ frames taken out of the fabricated pilot-frames r_(Pm) ^(k*)(m=0,1,2, . . . M′−1) for the k-th user u_(k)(k=0,1,2, . . . K) is made, that a sum of the frames which is made by multiplying the elements of plural virtual sequences C_(h)(c₀, c₁, . . . c_(Kγ−1)) by the respective frames of a said set U_(s) ^(k) is produced as a fabricated transmitted frame F_(sh) ^(k), and that correlations between respective fabricated transmitted frames F_(sh) ^(k) and the above-described synchronously received data-frame r_(D)* is obtained, and means of that the maximum likelihood fabricated transmitted frame is obtained based on the said correlations, and that a detected information-set consisting of the above-described transmitted information is obtained by judging an estimate-set corresponding to the original information-set using the constituent elements U_(s) ^(k) and C_(h) of the maximum likelihood fabricated transmitted frame.
 17. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 2 and 3, a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that the above-described fabricated pilot-frames r_(pm)* or r_(pm) ^(k*)(m=0,1,2, . . . M−1, k=0,1,2, . . . K−1) are generated, and such analyzing sequences w_(m) that the 0-shift-correlations with fabricated pilot-frames r_(pm)* and r_(pm′)*(m′≠m) may take 1 and 0, respectively, are produced, means of that plural estimate-sets set {β′}=(β₀′, β₁′, . . . β_(M−1)′) corresponding to the original information-set are produced based on the 0-shift correlations between the above-described synchronously received data-frame r_(D)* and analyzing sequences w_(m), that by judging the maximum likelihood set taken out of these estimate-sets a detected information-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)} consisting of the above-described transmitted information is obtained, or means of that plural analyzing sequences w_(m) ^(k) such that 0-shift-correlations with fabricated pilot-frames r_(pm) ^(k*) and r_(pm′) ^(K′*)(m′≠m, k′≠k; m′=m, k′≠k; m′≠m, k′=k) may take 1 and 0, respectively, are produced, means of that plural estimate-sets {β^(k′)}=(β₀ ^(k′), β₁ ^(k′), . . . β_(M−1) ^(k′)) corresponding to the original information-set are produced based on the 0-shift-correlations between the above-described synchronously received data-frame r_(D)* and the analyzing sequences w_(m) ^(k), and means of that by judging the maximum likelihood set taken out of these sets a detected information-set {{circumflex over (β)}^(kS)} consisting of the above-described transmitted information is obtained.
 18. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 3, 7 and 8, a transmitter comprises; means of that a binary to multi-level conversion is carried out by using such a method as to correspond a transmit-information of I bits to a case-number obtained by synthesizing the first selection where an optional number γ is selected out of the numbers of spreading sequences, ranging from one to γ_(m), and the second selection where γ spreading sequences are selected out of an above-described sequence-set consisting of M or M′ kinds of basic spreading sequences as the sequence kinds, means of that a selected sequence-set consisting of y selected spreading sequences is produced from the above-described original information-set {β} or {β^(k)} to produce a transmitting frame, and a receiver comprises such a function as to detect the above-described transmitted information of I bits per symbol-frame by providing; means of that fabricated pilot-frames are obtained based on the above-described channel response {μ}, and an estimate-set {β′} or {β^(k′)} corresponding to the original information-set is obtained by analyzing the above-described synchronously received data-frame r_(D)* with them, means of that while a detected value {circumflex over (γ)} for the transmitted spreading sequence number is obtained using the said estimate-set, and means of that a detected information-set {{circumflex over (β)}^(S)} or {{circumflex over (β)}^(kS)} consisting of γ selected information components is obtained per user.
 19. A CDMA communications system using multiple spreading sequences is characterized in that, in claim 7, a receiver comprises; means of that in solving an above-described system of M linear equations in M unknowns, it is assumed that frames produced by multiplying dummy-information-components {β^(D)}=(β_(M) ^(D), β_(M+1) ^(D), . . . β_(M+h−1) ^(D)) by h(≧1) dummy spreading sequences which are not included in the basic spreading sequence-set provided in a transmitter may be included in the above-described synchronously received data-frame, means of that M pieces of the said fabricated pilot-frames r_(pm)*(m=0,1,2, . . . M−1) and the (M+h) pieces of the said data analyzing sequences y_(n)(n=0,1,2, . . . M−h−1) are produced and an extended pilot-response-matrix P₊′ is produced by adding h additional row vectors A to M row vectors each having (M+h) elements which are produced from the 0-shift-correlations between the above-described fabricated pilot-frames r_(pm)* and the said data analyzing sequences y_(n), means of that a corrected data-response-matrix Φ₊″=(Φ₀″, Φ₁″, . . . Φ_(M+h−1)″)^(T) is produced using a method of adding correcting terms to the 0-shift-correlations between the above-described synchronously received data-frame r_(D)* and the data analyzing sequences y_(n), means of that a system of (M+h) linear equations in (M+h) unknowns which is made of the said enlarged pilot-response matrix P₊′, the corrected data-response-matrix Φ₊″ and an extended unknown matrix β₊′=(β′, β^(D))^(T)=(β₀′, β₁′, . . . β_(M−1)′, β_(M) ^(D), β_(M+1) ^(D), . . . β_(M+h−1) ^(D))^(T) is produced, and means of that after the said additional row vector A is selected so as to increase the determinant or normalized singular value of the said enlarged pilot-response-matrix P₊′ to enhance the regularity, an estimated set {β′} or {β^(k′)} corresponding to the original information-set is obtained by solving the said system of (M+h) linear equations in (M+h) unknowns.
 20. A CDMA communications system using multiple spreading sequences is characterized in that, in claim 2, a receiver comprises; means of that in solving an above-described system of M linear equations in M unknowns, an above-described enlarged pilot-matrix P₊′ is produced so as to enhance the regularity of the said matrix using the above-described fabricated pilot-frames r_(pm)*, h additional row vectors A, and h additional column vectors C which are random sequences, means of that an extended unknown matrix β₊′ is made by adding h additional dummy-information {β^(D)} to an unknown set {β′} consisting of M unknowns, means of that a corrected synchronously received data-frame r_(D+)* is made by adding correcting terms to the above-described synchronously received data-frame r_(D)*, means of that a solution set {β₊′} is obtained by solving a system of (M+h) linear equations in (M+h) unknowns which is composed of the said enlarged pilot-matrix ρ₊′, the extended unknown matrix β₊′, and the corrected received data-matrix d₊′ consisting of the chip-elements of the corrected synchronously received data-frame r_(D+)*, and plural solution sets {β₊*} are resultantly obtained corresponding to the said additional column vectors C by solving the said systems, and means of that the maximum likelihood solution taken out of the solution sets is set to an estimate-set {β′} corresponding to the original information-set.
 21. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 to 3, an identical sequence-set consisting of M kinds of basic spreading sequence allocated to some cells, and a scrambling sequence inherent to each cell is allocated to a cell, and a transmitter of the cell comprises; means of that a scrambled sequence-set is produced by multiplying respective sequences of the spreading sequence-set by the scrambling sequence inherent to the cell to produce a transmit-frame, and a receiver comprises; means of that pilot and data analyzing sequences are produced based on the above-described scrambled sequence-set to analyze the above-described synchronously received frame.
 22. A CDMA communications system using multiple spreading sequences is characterized in that, in claim 1, a transmitter of the k-th user u_(k) comprises; means of that a sequence-set consisting of M=M′=N kinds of basic spreading sequences (g₀, g₁, g₂, . . . g_(M−1)) is produced by multiplying code words (h₀, h₁, . . . h_(N−1)) consisting of rows of an hadmarl matrix with a size of N×N by a random sequence-set consisting of M′ kinds of spreading sequences (g₀ ⁰, g₁ ¹, . . . g_(M′−1) ⁰).
 23. A CDMA communications system using multiple spreading sequences is characterized in that, in claims 1 and 2, a transmitter comprises; means of that a sequence-set consisting of M=M′L kinds of cyclically shifted sequences is prepared as a basic spreading sequence-set by producing the s=(0,1,2, . . . L−1)-shift-sequences of respective spreading sequences which constitutes a sequence-set consisting of M′ kinds of spreading sequences (g₀, g₁, . . . g_(M′)) with L chips in sequence length, means of that transmit-information of I bits is converted into an information-set consisting of γ components {β^(S)} selected out of the basic spreading sequence-set, and means of that a transmit-frame is produced and transmitted by using a selected sequence-set {β^(S)g^(S)} corresponding to the said information-set, and a receiver detects the transmitted information of I bits per symbol-frame by producing a detected output-set {{circumflex over (β)}^(S)}={{circumflex over (β)}₀ ^(S), {circumflex over (β)}₁ ^(S), . . . {circumflex over (β)}_(γ−1) ^(S)} consisting of the information which the desired station has transmitted by the method stated in claim
 2. 